On maximum Estrada indices of \(k\)-trees
From MaRDI portal
Publication:890574
DOI10.1016/j.laa.2015.09.032zbMath1325.05106OpenAlexW2189749025MaRDI QIDQ890574
Publication date: 10 November 2015
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.laa.2015.09.032
Trees (05C05) Applications of graph theory (05C90) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18) Distance in graphs (05C12) Molecular structure (graph-theoretic methods, methods of differential topology, etc.) (92E10)
Related Items (3)
On the \(r\)-uniform linear hypertrees with extremal Estrada indices ⋮ Extremal Estrada indices of the weighted trees with fixed total weight sum ⋮ On maximum signless Laplacian Estrada indices of \(k\)-trees
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The Estrada index of unicyclic graphs
- On maximum Estrada indices of graphs with given parameters
- On maximum Estrada indices of bipartite graphs with some given parameters
- On the signless Laplacian spectra of \(k\)-trees
- On Estrada index of trees
- Tricyclic graph with maximal Estrada index
- On the Estrada index conjecture
- The Estrada index of chemical trees
- Independence polynomials of \(k\)-tree related graphs
- Tree-width, clique-minors, and eigenvalues.
- Estimating the Estrada index
- Sharp bounds of the Zagreb indices of \(k\)-trees
- Counting unlabeled \(k\)-trees
- Perturbation results for the Estrada index in weighted networks
- Lower bounds for Estrada Index
- Ancestors and descendants in evolving k‐tree models
- On acyclic simplicial complexes
- The number of labeled k-dimensional trees
This page was built for publication: On maximum Estrada indices of \(k\)-trees