Bounds on the number of closed walks in a graph and its applications

DOI10.1186/1029-242X-2014-199zbMath1371.05161OpenAlexW2157212562WikidataQ59323642 ScholiaQ59323642MaRDI QIDQ2405633

Xiaodan Chen, Jian Guo Qian

Publication date: 26 September 2017

Published in: Journal of Inequalities and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1186/1029-242x-2014-199

zbMATH Keywords

degree sequenceEstrada indexmaximum degreeZagreb indicesnumber of closed walks

Mathematics Subject Classification ID

Paths and cycles (05C38) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Applications of graph theory to circuits and networks (94C15)

Related Items (3)

Some chemical indices related to the number of triangles ⋮ Comparing large-scale graphs based on quantum probability theory ⋮ An exact formulation of the time-ordered exponential using path-sums

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The Estrada index of unicyclic graphs
• New upper bounds for estrada index of bipartite graphs
• Bounds of the Estrada index of graphs
• On Estrada index of trees
• On the Estrada index conjecture
• The Estrada index of chemical trees
• On the number of closed walks in vertex-transitive graphs
• Covering planar graphs with forests, one having bounded maximum degree
• Number of walks and degree powers in a graph
• Counting closed walks in generalized de Bruijn graphs
• Estimating the Estrada index
• Lower bounds for Estrada Index

This page was built for publication: Bounds on the number of closed walks in a graph and its applications