On the eccentric distance sum of graphs
From MaRDI portal
Publication:542834
DOI10.1016/j.jmaa.2011.02.086zbMath1277.05052MaRDI QIDQ542834
Aleksandar Ilić, Guihai Yu, Li-Hua Feng
Publication date: 20 June 2011
Published in: Journal of Mathematical Analysis and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jmaa.2011.02.086
extremal graphs; trees; eccentric distance sum; eccentric connectivity index; graph product; vertex eccentricity
05C35: Extremal problems in graph theory
05C10: Planar graphs; geometric and topological aspects of graph theory
05C12: Distance in graphs
Related Items
Unnamed Item, ASYMPTOTIC FORMULA OF ECCENTRIC DISTANCE SUM FOR VICSEK NETWORK, ECCENTRIC DISTANCE SUM OF SIERPIŃSKI GASKET AND SIERPIŃSKI NETWORK, Unnamed Item, The eccentric-distance sum of some graphs, General eccentric distance sum of graphs, ECCENTRIC DISTANCE SUM OF SUBSTITUTION TREE NETWORKS, AVERAGE GEODESIC DISTANCE OF NODE-WEIGHTED SIERPINSKI NETWORKS, Inverse Connective Eccentricity Index and its Applications, Some topological indices and graph properties, COMPARING THE SECOND MULTIPLICATIVE ZAGREB COINDEX WITH SOME GRAPH INVARIANTS, On the transmission-based graph topological indices, Unnamed Item, On the extremal values of the eccentric distance sum of trees, On the extremal values of the eccentric distance sum of trees, The extremal values of connective eccentricity index for trees and unicyclic graphs, The minimum eccentric distance sum of trees with given distance k-domination number, Further results on Zagreb eccentricity coindices, On the extreme eccentric distance sum of graphs with some given parameters, On the connective eccentricity index of trees and unicyclic graphs with given diameter, On eccentric distance sum and minimum degree, On the maximal eccentric distance sums of graphs, On the extremal total reciprocal edge-eccentricity of trees, Some extremal results on the connective eccentricity index of graphs, On the extremal graphs of diameter 2 with respect to the eccentric resistance-distance sum, Sharp bounds on the inverse sum indeg index, A short and unified proof of Yu et al.'s two results on the eccentric distance sum, Further results on the eccentric distance sum, On the extremal values of the eccentric distance sum of trees with a given maximum degree, On the general degree-eccentricity index of a graph, Embeddings into almost self-centered graphs of given radius, Connectivity, diameter, minimal degree, independence number and the eccentric distance sum of graphs, The eccentric weight of graphs, Inverse sum indeg index of graphs, Extremal graphs of given parameters with respect to the eccentricity distance sum and the eccentric connectivity index, Some further results on the eccentric distance sum, On eccentric distance sum and degree distance of graphs, On the extremal values of the eccentric distance sum of trees with a given domination number, On the adjacent eccentric distance sum of graphs, Extremal bipartite graphs and unicyclic graphs with respect to the eccentric resistance-distance sum, On the difference between the eccentric connectivity index and eccentric distance sum of graphs, On sufficient topological indices conditions for properties of graphs, Extremal graphs with respect to two distance-based topological indices, Weighted average geodesic distance of Vicsek network, Comparing eccentricity-based graph invariants, On the quotients between the eccentric connectivity index and the eccentric distance sum of graphs with diameter 2, Network similarity measure and Ediz eccentric connectivity index, The connective eccentricity index and modified second Zagreb index of Parikh word representable graphs, On the maximum value of the eccentric distance sums of cubic transitive graphs, General transmission lemma and Wiener complexity of triangular grids, On the minimum eccentric distance sum of bipartite graphs with some given parameters, On the maximal connective eccentricity index of bipartite graphs with some given parameters, Extremal values on the eccentric distance sum of trees, The relationship between the eccentric connectivity index and Zagreb indices, Computing the eccentric-distance sum for graph operations, Connective Steiner 3-eccentricity index and network similarity measure
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the eccentric connectivity index of a graph
- The eccentric connectivity index of nanotubes and nanotori
- The PI index of product graphs
- Zagreb, Harary and hyper-Wiener indices of graphs with a given matching number
- Spectral saturation: inverting the spectral Turán theorem
- The first and second Zagreb indices of some graph operations
- Turán's theorem and maximal degrees
- Application of graph theory: Relationship of eccentric connectivity index and Wiener's index with anti-inflammatory activity
- Wiener index of hexagonal systems
- Eccentric distance sum: A novel graph invariant for predicting biological and physical properties
- On eccentric connectivity index
- Distance in graphs
- Wiener-type invariants of some graph operations
- Eccentric Connectivity Index of Chemical Trees
- THE MAXIMUM CONNECTIVITY OF A GRAPH
- Wiener index of trees: Theory and applications