On the minimal energy ordering of trees with perfect matchings
From MaRDI portal
Publication:948680
DOI10.1016/j.dam.2007.09.027zbMath1214.05122OpenAlexW1966435319MaRDI QIDQ948680
Publication date: 17 October 2008
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2007.09.027
Related Items (12)
Consecutive chemical trees with respect to energy of graph ⋮ Results on energies for trees with a given diameter having perfect matching ⋮ Distance spectral radius of trees with given matching number ⋮ 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 ⋮ Ordering of the trees by minimal energies ⋮ Trees with minimal Laplacian coefficients ⋮ Some relations on the ordering of trees by minimal energies between subclasses of trees ⋮ Ordering of the trees with a perfect matching by minimal energies
Cites Work
- On the minimal energy of trees with a given diameter
- Minimum energy on trees with \(k\) pendent vertices
- On acyclic conjugated molecules with minimal energies
- On minimal energy ordering of acyclic conjugated molecules
- Unicyclic graphs with maximal energy
- On minimal energies of trees of a prescribed diameter
- Unicyclic graphs with minimal energy
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: On the minimal energy ordering of trees with perfect matchings
