Minimal Estrada Indices of the Trees with a Perfect Matching

DOI10.13001/1081-3810.3209zbMath1339.05057OpenAlexW2314154563MaRDI QIDQ2813048

Wen-Huan Wang, Chun-Xiang Zhai

Publication date: 14 June 2016

Published in: The Electronic Journal of Linear Algebra (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.13001/1081-3810.3209

zbMATH Keywords

perfect matchingEstrada indices

Mathematics Subject Classification ID

Trees (05C05) Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (2)

On the \(r\)-uniform linear hypertrees with extremal Estrada indices ⋮ Extremal Estrada indices of the weighted trees with fixed total weight sum

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The Estrada index of trees
• New upper bounds for estrada index of bipartite graphs
• On Estrada index of trees
• Tricyclic graph with maximal Estrada index
• On the Estrada index conjecture
• The Estrada index of chemical trees
• Lower bounds for Estrada index and Laplacian Estrada index
• On extremal bipartite unicyclic graphs
• Graphs with the maximal Estrada indices
• On the Estrada index of graphs with given number of cut edges
• Lower bounds for Estrada Index
• On the Estrada index of cacti

This page was built for publication: Minimal Estrada Indices of the Trees with a Perfect Matching