New upper bounds for estrada index of bipartite graphs
DOI10.1016/J.LAA.2011.01.034zbMATH Open1222.05157OpenAlexW2017882123WikidataQ61987717 ScholiaQ61987717MaRDI QIDQ550644FDOQ550644
A. R. Ashrafi, G. H. 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
Recommendations
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Applications of graph theory (05C90) Trees (05C05) Exact enumeration problems, generating functions (05A15) Distance in graphs (05C12) Combinatorial inequalities (05A20)
Cites Work
Cited In (12)
- More on the Estrada indices of trees
- On the Estrada index of cactus graphs
- New lower bounds for Estrada index
- The Spectral Moments of a Fullerene Graph and Their Applications
- On the Estrada and Laplacian Estrada indices of graphs
- On the Estrada index of bipartite graph
- Extremal Estrada indices of the weighted trees with fixed total weight sum
- Minimal Estrada indices of the trees with a perfect matching
- Graphs with the maximal Estrada indices
- Bounds on the number of closed walks in a graph and its applications
- Relationship between Laplacian and signless Laplacian coefficients of polythiophene
- The many facets of the Estrada indices of graphs and networks
This page was built for publication: New upper bounds for estrada index of bipartite graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q550644)
