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

DOI10.2140/PJM.1979.80.443MaRDI QIDQ754888zbMATH OpenOpenAlexFDO

Authors Frank Harary, Allen J. Schwenk

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)

Cited in

(17)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q754888)