Estrada and L-Estrada Indices of a Graph and Their Relationship with the Number of Spanning Trees

DOI10.46793/match.90-3.787aOpenAlexW4383370621MaRDI QIDQ6182456

Unnamed Author, Abolfazl Tehranian, M. Arabzadeh, Gholam Hossein Fath-Tabar

Publication date: 25 January 2024

Published in: Match - Communications in Mathematical and in Computer Chemistry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.46793/match.90-3.787a

Mathematics Subject Classification ID

Molecular structure (graph-theoretic methods, methods of differential topology, etc.) (92E10) Graphical indices (Wiener index, Zagreb index, Randi? index, etc.) (05C09) Chemical graph theory (05C92)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Lexicographical ordering by spectral moments of trees with a prescribed diameter
• Bounds on the estrada index of ISR (4,6)-fullerenes
• Zur Theorie der elementaren Mittel
• Lower bounds for Estrada index and Laplacian Estrada index
• On the Szeged and the Laplacian Szeged spectrum of a graph
• Estimating the Estrada index
• Graphs with maximum Laplacian and signless Laplacian Estrada index
• Laplacian Estrada index of trees
• On sum of powers of Laplacian eigenvalues and Laplacian Estrada index of graphs

This page was built for publication: Estrada and L-Estrada Indices of a Graph and Their Relationship with the Number of Spanning Trees