The unicyclic graphs with maximum degree resistance distance
From MaRDI portal
Publication:668205
DOI10.1016/j.amc.2015.06.063zbMath1410.05059OpenAlexW941655228MaRDI QIDQ668205
Guifu Su, Jun-feng Du, Jian-hua Tu
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.063
Distance in graphs (05C12) Molecular structure (graph-theoretic methods, methods of differential topology, etc.) (92E10)
Related Items
Computation of resistance distance and Kirchhoff index of the two classes of silicate networks, Some two-vertex resistances of the three-towers Hanoi graph formed by a fractal graph, Degree resistance distance of trees with some given parameters, On the resistance diameter of hypercubes, Some two-vertex resistances of nested triangle network
Cites Work
- Maximum Zagreb index, minimum hyper-Wiener index and graph connectivity
- On the degree distance of a graph
- The minimum degree distance of graphs of given order and size
- On resistance-distance and Kirchhoff index
- Wiener index of hexagonal systems
- Unicyclic and bicyclic graphs having minimum degree distance
- On a conjecture about tricyclic graphs with maximal energy
- Some rules on resistance distance with applications
- The Wiener and Terminal Wiener indices of trees
- Wiener index of trees: Theory and applications
- 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