The spectral approach to determining the number of walks in a graph

DOI10.2140/pjm.1979.80.443zbMath0417.05032OpenAlexW2064276984MaRDI QIDQ754888

Allen J. Schwenk, Frank Harary

Publication date: 1979

Published in: Pacific Journal of Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2140/pjm.1979.80.443

zbMATH Keywords

adjacency matrixnumber of closed walks

Mathematics Subject Classification ID

Enumeration in graph theory (05C30) Paths and cycles (05C38)

Related Items (16)

Distance spectrum and energy of graphs with small diameter ⋮ The \(H\)-join of arbitrary families of graphs -- the universal adjacency spectrum ⋮ The main eigenvalues and number of walks in self-complementary graphs ⋮ Inequalities for the number of walks in graphs ⋮ On the private provision of public goods on networks ⋮ Hermitian matrices of roots of unity and their characteristic polynomials ⋮ The walk distances in graphs ⋮ The walk partition and colorations of a graph ⋮ Basic trigonometric power sums with applications ⋮ Main eigenvalues and \((\kappa ,\tau )\)-regular sets ⋮ On tactical configurations with no four-cycles ⋮ Unnamed Item ⋮ On the expressive power of linear algebra on graphs ⋮ On the displacement of eigenvalues when removing a twin vertex ⋮ Degree series of the 3-harmonic graphs ⋮ Some results on graph spectra

This page was built for publication: The spectral approach to determining the number of walks in a graph