Results on energies for trees with a given diameter having perfect matching
From MaRDI portal
Publication:2917971
DOI10.1007/s11741-011-0774-1zbMath1265.05107OpenAlexW174484642MaRDI QIDQ2917971
Publication date: 5 October 2012
Published in: Journal of Shanghai University (English Edition) (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11741-011-0774-1
Trees (05C05) Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On unicyclic conjugated molecules with minimal energies
- On the minimal energy of trees with a given diameter
- Minimum energy on trees with \(k\) pendent vertices
- Fully-angular polyhex chains with minimal total \(\pi\)-electron energy
- Minimal energy of unicyclic graphs of a given diameter
- On the minimal energy ordering of trees with perfect matchings
- On tricyclic graphs of a given diameter with minimal energy
- Ordering of the trees by minimal energies
- Ordering of the trees with a perfect matching by minimal energies
- On the ordering of graphs with respect to their matching numbers
- On acyclic conjugated molecules with minimal energies
- Energy ordering of catacondensed hexagonal systems
- Some results on energy of unicyclic graphs with \(n\) vertices
- Unicyclic graphs possessing Kekulé structures with minimal energy
- On minimal energies of trees of a prescribed diameter
- Bicyclic graphs with minimum energy
- Unicyclic graphs with minimal energy
This page was built for publication: Results on energies for trees with a given diameter having perfect matching
