The Laplacian spectrum of a graph
SIAM Journal on Matrix Analysis and Applications
Laplace eigenvalues of graphs—a survey
Discrete Mathematics - Algebraic graph theory; a volume dedicated to Gert Sabidussi
On the Spectrum and Structure of Internet Topology Graphs
IICS '02 Proceedings of the Second International Workshop on Innovative Internet Computing Systems
Ring structure digraphs: Spectrum of adjacency matrix and application
Automation and Remote Control
| Hi-index | 0.00 |
The Laplace matrix is a square matrix L = (驴 ij ) 驴 驴 n脳n in which all nondiagonal elements are nonpositive and all row sums are equal to zero. Each Laplace matrix corresponds to a weighted orgraph with positive arc weights. The problem of reality of Laplace matrix spectrum for orgraphs of a special type consisting of two "counter" Hamiltonian cycles in one of which one or two arcs are removed is studied. Characteristic polynomials of Laplace matrices of these orgraphs are expressed through polynomials Z n (x) that can be obtained from Chebyshev second-kind polynomials P 2n (y) by the substitution of y 2 = x. The obtained results relate to properties of the product of Chebyshev second-kind polynomials. A direct method for computing the spectrum of Laplace circuit matrix is given. The obtained results can be used for computing the number of spanning trees in orgraphs of the studied type. One of the possible practical applications of these results is the investigation of topology and development of new Internet protocols.