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
-
An inertial method for solving the split equality fixed point problem with multiple output sets
-
Asymptotic modeling of non-linear viscopiezoelectric Kelvin-Voigt type plates via Trotter theory
-
Properties of isocompact spaces in topological groups
-
Two generalized cyclic projection algorithms for solving a class of the split feasibility problem in real Hilbert spaces
-
Global-fixed-point property of gyrogroup actions
-
On simple normal structure and best proximity points in reflexive Banach space
-
Unified Convergence Analysis of Certain At Least Fifth Order Methods
-
A set packing model for the Partition Coloring Problem
-
Cut-through connections of graphs
-
Positive solutions for multipoint boundary value problem of fractional differential equation with parameter