New upper bounds for estrada index of bipartite graphs

DOI10.1016/j.laa.2011.01.034zbMath1222.05157OpenAlexW2017882123WikidataQ61987717 ScholiaQ61987717MaRDI QIDQ550644

Ali Reza Ashrafi, Gholam Hossein Fath-Tabar

Publication date: 13 July 2011

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.laa.2011.01.034

zbMATH Keywords

eigenvalue(4,6)-Fullereneestrada index

Mathematics Subject Classification ID

Trees (05C05) Applications of graph theory (05C90) Exact enumeration problems, generating functions (05A15) Combinatorial inequalities (05A20) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Distance in graphs (05C12)

Related Items

The many facets of the Estrada indices of graphs and networks, Bounds on the number of closed walks in a graph and its applications, More on the Estrada indices of trees, Relationship between Laplacian and signless Laplacian coefficients of polythiophene, Graphs with the maximal Estrada indices, The Spectral Moments of a Fullerene Graph and Their Applications, Extremal Estrada indices of the weighted trees with fixed total weight sum, On the Estrada and Laplacian Estrada indices of graphs, Minimal Estrada Indices of the Trees with a Perfect Matching, On the Estrada index of cactus graphs

Cites Work

• Bounds of the Estrada index of graphs
• Bounds on the estrada index of ISR (4,6)-fullerenes
• The Estrada index of chemical trees
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item