Further results on the eccentric distance sum

From MaRDI portal
Publication:765351

DOI10.1016/j.dam.2011.10.002zbMath1237.05058OpenAlexW2040913374MaRDI QIDQ765351

Hong-Bo Hua, Kexiang Xu, Sheng Gui Zhang

Publication date: 19 March 2012

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2011.10.002




Related Items (30)

On the extreme eccentric distance sum of graphs with some given parametersOn a novel eccentricity-based invariant of a graphThe irregularity of some composite graphsConnectivity, diameter, minimal degree, independence number and the eccentric distance sum of graphsOn eccentric distance sum and minimum degreeExtremal values on Zagreb indices of trees with given distance \(k\)-domination numberComparing eccentricity-based graph invariantsOn the quotients between the eccentric connectivity index and the eccentric distance sum of graphs with diameter 2On the eccentric distance sum of trees with given maximum degreeExtremal values on the eccentric distance sum of treesComputing the eccentric-distance sum for graph operationsExtremal graphs of given parameters with respect to the eccentricity distance sum and the eccentric connectivity indexFirst reformulated Zagreb indices of some classes of graphsInverse Connective Eccentricity Index and its ApplicationsSome extremal results on the connective eccentricity index of graphsEccentric adjacency index of graphs with a given number of cut edgesOn the extremal graphs of diameter 2 with respect to the eccentric resistance-distance sumOn the extremal values of the eccentric distance sum of treesOn the extremal values of the eccentric distance sum of trees with a given domination numberOn some bounds and exact formulae for connective eccentric indices of graphs under some graph operationsExtremal bipartite graphs and unicyclic graphs with respect to the eccentric resistance-distance sumOn the maximum value of the eccentric distance sums of cubic transitive graphsSome further results on the eccentric distance sumASYMPTOTIC FORMULA OF ECCENTRIC DISTANCE SUM FOR VICSEK NETWORKOn eccentric distance sum and degree distance of graphsOn the extremal values of the eccentric distance sum of trees with a given maximum degreeTree with maximum non-self-centrality number among all trees of fixed order and maximum degreeOn extremal bipartite graphs with given number of cut edgesThe minimum eccentric distance sum of trees with given distance k-domination numberOn the minimum eccentric distance sum of bipartite graphs with some given parameters



Cites Work




This page was built for publication: Further results on the eccentric distance sum