Maximal Estrada index of unicyclic graphs with perfect matching
From MaRDI portal
Publication:1676996
DOI10.1007/S12190-016-1014-YzbMATH Open1373.05112OpenAlexW2387098439MaRDI QIDQ1676996FDOQ1676996
Publication date: 10 November 2017
Published in: Journal of Applied Mathematics and Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s12190-016-1014-y
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Trees (05C05) Extremal problems in graph theory (05C35) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Cites Work
- Network Properties Revealed through Matrix Functions
- The Estrada index of chemical trees
- On the Estrada and Laplacian Estrada indices of graphs
- The Estrada index of evolving graphs
- On the Estrada index of graphs with given number of cut edges
- The Estrada index of unicyclic graphs
- On Estrada index of trees
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
Recommendations
- Unicyclic graph with maximal Estrada indices π π
- The Estrada index of unicyclic graphs π π
- Title not available (Why is that?) π π
- Maximum Estrada index of bicyclic graphs π π
- Graphs with the maximal Estrada indices π π
- Maximum Wiener Indices of Unicyclic Graphs of Given Matching Number π π
- On the edge-Szeged index of unicyclic graphs with perfect matchings π π
- On maximum Estrada indices of graphs with given parameters π π
- Title not available (Why is that?) π π
- A note on the Estrada index of unicyclic graphs with even girth π π
This page was built for publication: Maximal Estrada index of unicyclic graphs with perfect matching
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1676996)