On maximum signless Laplacian Estrada indices of \(k\)-trees
From MaRDI portal
Publication:2279989
DOI10.1016/j.disc.2019.111666zbMath1429.05131OpenAlexW2977137439MaRDI QIDQ2279989
Publication date: 17 December 2019
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2019.111666
Cites Work
- Characterizing graphs with maximal Laplacian Estrada index
- Multiplicative Zagreb indices of \(k\)-trees
- Maximum Estrada index of bicyclic graphs
- On the signless Laplacian spectra of \(k\)-trees
- On the Estrada and Laplacian Estrada indices of graphs
- Sharp bounds for Zagreb indices of maximal outerplanar graphs
- Signless Laplacians of finite graphs
- On maximum Estrada indices of \(k\)-trees
- Independence polynomials of \(k\)-tree related graphs
- Which graphs are determined by their spectrum?
- Tree-width, clique-minors, and eigenvalues.
- An upper bound on the sum of squares of degrees in a graph
- An analog of matrix tree theorem for signless Laplacians
- On the signless Laplacian Estrada index of bicyclic graphs
- On the signless Laplacian Estrada index of cacti
- New bounds for the signless Laplacian spread
- Graphs with the maximal Estrada indices
- Sharp bounds of the Zagreb indices of \(k\)-trees
- Counting unlabeled \(k\)-trees
- Graphs with maximum Laplacian and signless Laplacian Estrada index
- On extremal bipartite bicyclic graphs
- On maximum signless Laplacian Estrada index of graphs with given parameters
- Sharp bounds on the signless Laplacian Estrada index of graphs
- The signless Laplacian Estrada index of tricyclic graphs
- On maximum signless Laplacian Estrada index of graphs with given parameters II
- Ancestors and descendants in evolving k‐tree models
- On acyclic simplicial complexes
- The number of labeled k-dimensional trees
- On the maximum Laplacian Estrada index of graphs
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: On maximum signless Laplacian Estrada indices of \(k\)-trees
