On the extremal values of the eccentric distance sum of trees

From MaRDI portal
Publication:5891484

DOI10.1016/J.JMAA.2012.01.022zbMath1241.05055OpenAlexW1981903721MaRDI QIDQ5891484

No author found.

Publication date: 29 March 2012

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.2012.01.022




Related Items (30)

On the maximal connective eccentricity index of bipartite graphs with some given parametersOn the extreme eccentric distance sum of graphs with some given parametersThe normalized Laplacians, degree-Kirchhoff index and the spanning trees of linear hexagonal chainsOn connected graphs having the maximum connective eccentricity indexSome edge-grafting transformations on the eccentricity resistance-distance sum and their applicationsConnectivity, diameter, minimal degree, independence number and the eccentric distance sum of graphsOn the eccentric distance sum of trees with given maximum degreeEdge-grafting transformations on the average eccentricity of graphs and their applicationsExtremal 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 indexInverse Connective Eccentricity Index and its ApplicationsOn the extremal total reciprocal edge-eccentricity of treesCacti with maximum eccentricity resistance-distance sumOn the extremal graphs of diameter 2 with respect to the eccentric resistance-distance sumOn the extremal values of the eccentric distance sum of treesThe extremal values of connective eccentricity index for trees and unicyclic graphsOn the extremal values of the eccentric distance sum of trees with a given domination numberExtremal bipartite graphs and unicyclic graphs with respect to the eccentric resistance-distance sumOn the maximum value of the eccentric distance sums of cubic transitive graphsCalculating the normalized Laplacian spectrum and the number of spanning trees of linear pentagonal chainsSome topological indices and graph propertiesSome further results on the eccentric distance sumASYMPTOTIC FORMULA OF ECCENTRIC DISTANCE SUM FOR VICSEK NETWORKOn the extremal graphs with respect to the total reciprocal edge-eccentricityExtremal trees of given segment sequence with respect to some eccentricity-based invariantsOn the extremal values of the eccentric distance sum of trees with a given maximum degreeThe minimum eccentric distance sum of trees with given distance k-domination numberECCENTRIC DISTANCE SUM OF SUBSTITUTION TREE NETWORKSOn the minimum eccentric distance sum of bipartite graphs with some given parameters




Cites Work




This page was built for publication: On the extremal values of the eccentric distance sum of trees