Status connectivity indices and co-indices of graphs and its computation to some distance-balanced graphs
DOI10.1016/j.akcej.2018.09.002zbMath1473.05067arXiv1611.08270OpenAlexW2889706143MaRDI QIDQ5154566
Reza Sharafdini, Ashwini S. Yalnaik, Harishchandra S. Ramane
Publication date: 5 October 2021
Published in: AKCE International Journal of Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1611.08270
Distance in graphs (05C12) Molecular structure (graph-theoretic methods, methods of differential topology, etc.) (92E10) Vertex degrees (05C07) Graphical indices (Wiener index, Zagreb index, Randi? index, etc.) (05C09) Chemical graph theory (05C92)
Related Items (5)
Cites Work
- Degree distance of unicyclic and bicyclic graphs
- The complexity of obtaining a distance-balanced graph
- The Zagreb coindices of graph operations
- On a conjecture about the Szeged index
- Distance-balanced graphs
- On the degree distance of a graph
- Computation of topological indices of some graphs
- The minimum degree distance of graphs of given order and size
- Strongly distance-balanced graphs and graph products
- The first and second Zagreb indices of some graph operations
- Properties of connected graphs having minimum degree distance
- Status connectivity indices of graphs and its applications to the boiling point of benzenoid hydrocarbons
- Some extremal properties of the degree distance of a graph
- Zagreb indices of graphs
- Unicyclic and bicyclic graphs having minimum degree distance
- Topological indices of the Kneser graph KG n,k
- Vertex-weighted Wiener polynomials for composite graphs
- ON THE WIENER INDEX OF A GRAPH
- Wiener index of trees: Theory and applications
- Further properties on the degree distance of graphs
- 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: Status connectivity indices and co-indices of graphs and its computation to some distance-balanced graphs