Ordering of the trees with a perfect matching by minimal energies

DOI10.1016/j.laa.2009.03.053zbMath1172.05014OpenAlexW2067962315MaRDI QIDQ1030758

Wen-Huan Wang, Li-ying Kang

Publication date: 2 July 2009

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.laa.2009.03.053

zbMATH Keywords

treeorderingperfect matchingminimal energy

Mathematics Subject Classification ID

Trees (05C05) Extremal problems in graph theory (05C35) Perfect graphs (05C17)

Related Items (8)

Consecutive chemical trees with respect to energy of graph ⋮ Results on energies for trees with a given diameter having perfect matching ⋮ Minimal energies of trees with given parameters ⋮ Absolute algebraic connectivity of double brooms and trees ⋮ Characterizing trees with large Laplacian energy ⋮ The minimal randić energy of trees with given diameter ⋮ Ordering trees and graphs with few cycles by algebraic connectivity ⋮ Some relations on the ordering of trees by minimal energies between subclasses of trees

Cites Work

• On the minimal energy ordering of trees with perfect matchings
• Ordering of Hückel trees according to minimal energies
• On the ordering of graphs with respect to their matching numbers
• On acyclic conjugated molecules with minimal energies
• On minimal energy ordering of acyclic conjugated molecules
• Unicyclic graphs with maximal energy
• Unicyclic graphs possessing Kekulé structures with minimal energy
• Unicyclic graphs with minimal energy
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Ordering of the trees with a perfect matching by minimal energies