On the estrada index of graphs with given number of cut edges
From MaRDI portal
Recommendations
Cited in
(29)- Maximal Estrada index of unicyclic graphs with perfect matching
- On the monotonicity of topological indices and the connectivity of a graph
- An edge grafting theorem on the Estrada index of graphs and its applications
- Eccentric adjacency index of graphs with a given number of cut edges
- Extremal Estrada indices of the weighted trees with fixed total weight sum
- The many facets of the Estrada indices of graphs and networks
- On the graph connectivity and the variable sum exdeg index
- On the \(A_\sigma\)-spectral radii of graphs with some given parameters
- Spectral moments of trees with given degree sequence
- Graphs with the maximal Estrada indices
- On the Estrada index of cactus graphs
- On extremal bipartite bicyclic graphs
- The trace and Estrada index of uniform hypergraphs with cut vertices
- Minimal Estrada indices of the trees with a perfect matching
- Some indices of graphs with more than one cut-edge.
- Some extremal properties of the resolvent energy, Estrada and resolvent Estrada indices of graphs
- The Estrada index of unicyclic graphs
- On maximum Estrada indices of graphs with given parameters
- Spectral radius of graphs
- Maximum Estrada index of bicyclic graphs
- On the spectrum of linear dependence graph of a finite dimensional vector space
- On the Estrada index of point attaching strict \(k\)-quasi tree graphs
- More on the Estrada indices of trees
- Tetracyclic graphs with maximal Estrada index
- On the Estrada index of cacti
- On the Estrada and Laplacian Estrada indices of graphs
- On the multiplicative sum Zagreb index of graphs with some given parameters
- On the Seidel Estrada index of graphs
- Tricyclic graph with maximal Estrada index
This page was built for publication: On the estrada index of graphs with given number of cut edges
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3091581)