On the tree with diameter 4 and maximal energy
From MaRDI portal
Publication:668121
DOI10.1016/j.amc.2015.06.060zbMath1410.05140OpenAlexW882536109MaRDI QIDQ668121
Qiangqiang Diao, Shengjin Ji, Bofeng Huo, Suonan Renqian, Yunpeng Ge
Publication date: 18 March 2019
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2015.06.060
Related Items (11)
The maximum matching energy of bicyclic graphs with even girth ⋮ Spectral properties with the difference between topological indices in graphs ⋮ The matching energy of graphs with given edge connectivity ⋮ On ordering of complements of graphs with respect to matching numbers ⋮ Solutions to unsolved problems on the minimal energies of two classes of trees ⋮ Extremal Laplacian energy of threshold graphs ⋮ On energy and Laplacian energy of bipartite graphs ⋮ Spectral properties of geometric-arithmetic index ⋮ Upper bounds of the energy of triangle-free graphs in terms of matching number ⋮ Upper bounds on the energy of graphs in terms of matching number ⋮ The energy of trees with diameter five under given conditions
Cites Work
- Solution to a conjecture on the maximal energy of bipartite bicyclic graphs
- On the maximal energy tree with two maximum degree vertices
- Complete solution to a problem on the maximal energy of unicyclic bipartite graphs
- Complete solution to a conjecture on the maximal energy of unicyclic graphs
- On the minimal energy of trees with a given diameter
- Connected \((n,m)\)-graphs with minimum and maximum zeroth-order general Randić index
- On acyclic molecular graphs with maximal Hosoya index, energy, and short diameter
- On tricyclic graphs of a given diameter with minimal energy
- Unicyclic graphs with maximal energy
- On minimal energies of trees of a prescribed diameter
- Graph Energy
- On a conjecture about tricyclic graphs with maximal energy
- The Maximal Matching Energy of Tricyclic Graphs
- Median eigenvalues of bipartite subcubic graphs
- Note on unicyclic graphs with given number of pendent vertices and minimal energy
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: On the tree with diameter 4 and maximal energy