Additional Information
| Author(s) | Diudea, Mircea V., John, Peter E. |
|---|
The Second Path Matrix of the Graph and its Characteristic Polynomial
Peter E. John ♦ Mircea V. Diudea
Abstract
carpathian_2004_20_235_239_abstractFull PDF
carpathian_2004_20_235_239The second path matrix S(G) collects all the second paths in the graph G. Its characteristic polynomial shows some regularity in several particular graphs, such as paths, cycles, stars and complete graphs, as well as in bipartite graphs. Formulas for calculating the characteristic polynomials in these graphs are given. The first eigenvalue of S(G) showed an excellent correlating ability.
Recently posted
-
Weak and Strong Convergence of Split Douglas-Rachford Algorithms for Monotone Inclusions
-
Fixed point theorems for basic θ-contraction and applications
-
A Fast Forward-Backward Algorithm Using Linesearch and Inertial Techniques for Convex Bi-level Optimization Problems with Applications
-
Convergence of self-adaptive Tseng-type algorithms for split variational inequalities and fixed point problems
-
A fast contraction algorithm using two inertial extrapolations for variational inclusion problem and data classification
-
Periodic cycles for an extension of generalized 3x + 1 functions
-
Some remarks on expansive mappings in metric spaces
-
Asymptotically α hemicontractive mappings in Hilbert spaces and a new algorithm for solving associated split common fixed point problem
-
Extreme solution for fractional differential equation with nonlinear boundary condition
-
Generalized Split Feasibility Problem: Solution by Iteration