The number of walks in a graph

DOI10.1016/S0893-9659(03)00085-5zbMath1039.05043OpenAlexW2028322627MaRDI QIDQ1431887

Ivan Gutman, Andreas W. M. Dress

Publication date: 11 June 2004

Published in: Applied Mathematics Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0893-9659(03)00085-5

zbMATH Keywords

EigenvaluesEigenvectorsSpectral graph theoryHarmonic graphsRegular graphsSemiharmonic graphsSemiregular graphsWalks in graphs

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Graph theory (05C99)

Related Items (17)

Well-mixing vertices and almost expanders ⋮ Ordering starlike trees by the totality of their spectral moments ⋮ Unnamed Item ⋮ A path forward: tropicalization in extremal combinatorics ⋮ Inequalities for the number of walks in graphs ⋮ Matrix power inequalities and the number of walks in graphs ⋮ Asymptotic results regarding the number of walks in a graph ⋮ Semiharmonic trees and monocyclic graphs ⋮ 2-Walk linear graphs with small number of cycles ⋮ A note on Hoffman-type identities of graphs ⋮ The integral 3-harmonic graphs ⋮ An increasing sequence of lower bounds for the Estrada index of graphs and matrices ⋮ Bicyclic graphs with exactly two main eigenvalues ⋮ Some new aspects of main eigenvalues of graphs ⋮ Unicyclic graphs with exactly two main eigenvalues ⋮ Harmonic trees ⋮ Semiharmonic bicyclic graphs

Cites Work

• Semiharmonic trees and monocyclic graphs
• Harmonic trees
• Harmonic graphs with small number of cycles
• Unnamed Item

This page was built for publication: The number of walks in a graph