Maximal Estrada index of unicyclic graphs with perfect matching

DOI10.1007/s12190-016-1014-yzbMath1373.05112OpenAlexW2387098439MaRDI QIDQ1676996

Zhongxun Zhu

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

zbMATH Keywords

perfect matchingunicyclic graphEstrada index

Mathematics Subject Classification ID

Trees (05C05) Extremal problems in graph theory (05C35) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Cites Work

• The Estrada index of unicyclic graphs
• On the Estrada and Laplacian Estrada indices of graphs
• On Estrada index of trees
• The Estrada index of chemical trees
• The Estrada index of evolving graphs
• Network Properties Revealed through Matrix Functions
• On the Estrada index of graphs with given number of cut edges
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Maximal Estrada index of unicyclic graphs with perfect matching