On the minimal energy of trees with a given number of vertices of odd degree
From MaRDI portal
Publication:5279092
Recommendations
Cited in
(12)- On ordering of complements of graphs with respect to matching numbers
- On energy of line graphs
- scientific article; zbMATH DE number 6113894 (Why is no real title available?)
- The minimal-energy graph for a forest with a given number of components
- On line graphs with maximum energy
- On bipartite graphs with minimal energy
- Minimum energy on trees with \(k\) pendent vertices
- On the minimal energy of graphs
- Bicyclic oriented graphs with skew-rank 2 or 4
- Solutions to unsolved problems on the minimal energies of two classes of trees
- Conjugated chemical trees with extremal energy
- A lower bound for the energy of symmetric matrices and graphs
This page was built for publication: On the minimal energy of trees with a given number of vertices of odd degree
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5279092)