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
-
Stability of new functional equations and partial multipliers in Banach *-algebras
-
Characterizations of amenable gyrogroups related to Tarski's Theorem
-
Two new extragradient methods for solving pseudomonotone the equilibrium problem in Hilbert spaces
-
On the error estimates for the sequence of successive approximations for cyclic \varphi–contractions in metric spaces
-
Hybrid CG-Like Algorithm for Nonlinear Equations and Image Restoration
-
New class of n-order fractional differential equations and solvability in the double sequence space m^2(\Delta_{v}^{u}, \phi,p)
-
Constructing DNA Codes using Double Cyclic Codes of Odd and Even Lengths over F2 + u F2
-
Consequences of the product rule in Stieltjes differentiability
-
On the existence and uniqueness of fixed points in Banach spaces using the Krasnoselskij iterative method
-
A quaternionic product of simple ratios