More on the Estrada indices of trees
From MaRDI portal
Publication:5347259
DOI10.1142/S1793830917500252zbMath1362.05085OpenAlexW2586737878MaRDI QIDQ5347259
Publication date: 23 May 2017
Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s1793830917500252
Trees (05C05) Extremal problems in graph theory (05C35) Applications of graph theory (05C90) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Distance in graphs (05C12)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The Estrada index of unicyclic graphs
- Maximum Estrada index of bicyclic graphs
- New upper bounds for estrada index of bipartite graphs
- On Estrada index of trees
- Bounds on the estrada index of ISR (4,6)-fullerenes
- Tricyclic graph with maximal Estrada index
- On the Estrada index conjecture
- The Estrada index of chemical trees
- Quadrature rule-based bounds for functions of adjacency matrices
- On the two largest eigenvalues of trees
- On extremal bipartite unicyclic graphs
- Graphs with the maximal Estrada indices
- Network Properties Revealed through Matrix Functions
- On the Estrada index of graphs with given number of cut edges
- On the nullity of graphs
- Ordering trees by their largest eigenvalues
- Ordering trees by their largest eigenvalues
This page was built for publication: More on the Estrada indices of trees