On the minimal energy of trees with a given number of vertices of odd degree
From MaRDI portal
Publication:5279092
zbMATH Open1464.05254MaRDI QIDQ5279092FDOQ5279092
Authors: Tao Tian, Weigen Yan, Shuli Li
Publication date: 19 July 2017
Recommendations
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Extremal problems in graph theory (05C35) Vertex degrees (05C07) Molecular structure (graph-theoretic methods, methods of differential topology, etc.) (92E10) Chemical graph theory (05C92)
Cited In (12)
- On ordering of complements of graphs with respect to matching numbers
- The minimal-energy graph for a forest with a given number of components
- Title not available (Why is that?)
- On energy of line graphs
- On line graphs with maximum energy
- On bipartite graphs with minimal energy
- On the minimal energy of graphs
- Minimum energy on trees with \(k\) pendent vertices
- 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)