Comparative results and bounds for the eccentric-adjacency index
From MaRDI portal
Publication:2197419
DOI10.1016/j.dam.2020.05.019zbMath1447.05058OpenAlexW3034462359MaRDI QIDQ2197419
Kinkar Chandra Das, Hong-Bo Hua
Publication date: 31 August 2020
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2020.05.019
Trees (05C05) Distance in graphs (05C12) Molecular structure (graph-theoretic methods, methods of differential topology, etc.) (92E10) Connectivity (05C40) Graphical indices (Wiener index, Zagreb index, Randi? index, etc.) (05C09) Chemical graph theory (05C92)
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On Wiener and multiplicative Wiener indices of graphs
- Minimum degree, edge-connectivity and radius
- Comparison between the zeroth-order Randić index and the sum-connectivity index
- Relations between distance-based and degree-based topological indices
- Spanning trees with many leaves and average distance
- Average distance and domination number
- Two degree-distance based topological descriptors of some product graphs
- On eccentric distance sum and degree distance of graphs
- On the adjacent eccentric distance sum of graphs
- Comparison between the Szeged index and the eccentric connectivity index
- The difference between remoteness and radius of a graph
- Wiener index in weighted graphs via unification of \(\varTheta^\ast\)-classes
- The relationship between the eccentric connectivity index and Zagreb indices
- Proof of conjectures on remoteness and proximity in graphs
- Proximity and remoteness in graphs: Results and conjectures
- The average distance and the independence number
- Wiener index of trees: Theory and applications
This page was built for publication: Comparative results and bounds for the eccentric-adjacency index
