Computing the eccentric-distance sum for graph operations

DOI10.1016/j.dam.2013.06.003zbMath1287.05034OpenAlexW1984038227MaRDI QIDQ2446873

Ali Iranmanesh, Mahdieh Azari

Publication date: 23 April 2014

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

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

zbMATH Keywords

distanceeccentricitygraph operations

Mathematics Subject Classification ID

Applications of graph theory (05C90) Distance in graphs (05C12) Graph operations (line graphs, products, etc.) (05C76)

Related Items (34)

Distance and eccentricity based invariants of windmill graph ⋮ Sharp lower bounds on the Narumi-Katayama index of graph operations ⋮ On the extreme eccentric distance sum of graphs with some given parameters ⋮ F-Index of some graph operations ⋮ Vertex-weighted Wiener polynomials of subdivision-related graphs ⋮ Unnamed Item ⋮ Graph products and eccentric harmonic index ⋮ Weighted average geodesic distance of Vicsek network ⋮ Generalized Zagreb index of product graphs ⋮ Further results on non-self-centrality measures of graphs ⋮ Zagreb connection indices of molecular graphs based on operations ⋮ AVERAGE GEODESIC DISTANCE OF NODE-WEIGHTED SIERPINSKI NETWORKS ⋮ Comparing eccentricity-based graph invariants ⋮ Reformulated first Zagreb index of some graph operations ⋮ Unnamed Item ⋮ The first general Zagreb coindex of graph operations ⋮ The vertex Zagreb indices of some graph operations ⋮ Extremal graphs of given parameters with respect to the eccentricity distance sum and the eccentric connectivity index ⋮ Bounds for the general sum-connectivity index of composite graphs ⋮ On the maximum value of the eccentric distance sums of cubic transitive graphs ⋮ COMPARING THE SECOND MULTIPLICATIVE ZAGREB COINDEX WITH SOME GRAPH INVARIANTS ⋮ Some further results on the eccentric distance sum ⋮ ASYMPTOTIC FORMULA OF ECCENTRIC DISTANCE SUM FOR VICSEK NETWORK ⋮ On eccentric distance sum and degree distance of graphs ⋮ ECCENTRIC DISTANCE SUM OF SIERPIŃSKI GASKET AND SIERPIŃSKI NETWORK ⋮ Splice Graphs and their Vertex-Degree-Based Invariants ⋮ Eccentric connectivity coindex under graph operations ⋮ Unnamed Item ⋮ On the eccentric complexity of graphs ⋮ Extremal trees of given segment sequence with respect to some eccentricity-based invariants ⋮ The eccentric-distance sum of some graphs ⋮ Further results on Zagreb eccentricity coindices ⋮ General eccentric distance sum of graphs ⋮ On the minimum eccentric distance sum of bipartite graphs with some given parameters

Cites Work

• On the eccentric distance sum of graphs
• A short and unified proof of Yu et al.'s two results on the eccentric distance sum
• On the eccentric distance sum of trees and unicyclic graphs
• Further results on the eccentric distance sum
• The hyper-Wiener index of graph operations
• Eccentric distance sum: A novel graph invariant for predicting biological and physical properties
• Vertex-weighted Wiener polynomials for composite graphs
• Eccentric Connectivity Index of Chemical Trees
• On the extremal values of the eccentric distance sum of trees
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Computing the eccentric-distance sum for graph operations