Computing the eccentric-distance sum for graph operations
From MaRDI portal
Publication:2446873
Recommendations
Cites work
- A method for calculating an edge version of the Wiener number of a graph operation
- A short and unified proof of Yu et al.'s two results on the eccentric distance sum
- Eccentric Connectivity Index of Chemical Trees
- Eccentric distance sum: A novel graph invariant for predicting biological and physical properties
- Further results on the eccentric distance sum
- scientific article; zbMATH DE number 6093189 (Why is no real title available?)
- scientific article; zbMATH DE number 1550912 (Why is no real title available?)
- scientific article; zbMATH DE number 1890136 (Why is no real title available?)
- scientific article; zbMATH DE number 2114503 (Why is no real title available?)
- On the eccentric distance sum of graphs
- On the eccentric distance sum of trees and unicyclic graphs
- On the extremal values of the eccentric distance sum of trees
- The hyper-Wiener index of graph operations
- Vertex-weighted Wiener polynomials for composite graphs
Cited in
(41)- On the sum of all distances in composite graphs
- Topological efficiency under graph operations
- 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
- Eccentric connectivity coindex under graph operations
- Weighted average geodesic distance of Vicsek network
- Zagreb connection indices of molecular graphs based on operations
- Comparing eccentricity-based graph invariants
- On the maximum value of the eccentric distance sums of cubic transitive graphs
- On the eccentric complexity of graphs
- On the minimum eccentric distance sum of bipartite graphs with some given parameters
- The first general Zagreb coindex of graph operations
- Sharp lower bounds on the Narumi-Katayama index of graph operations
- On the extreme eccentric distance sum of graphs with some given parameters
- The vertex Zagreb indices of some graph operations
- F-index of some graph operations
- Vertex-weighted Wiener polynomials of subdivision-related graphs
- Splice graphs and their vertex-degree-based invariants
- Asymptotic formula of eccentric distance sum for Vicsek network
- Eccentric distance sum of Sierpiński gasket and Sierpiński network
- Generalized Zagreb index of product graphs
- The eccentric-distance sum of some graphs
- General eccentric distance sum of graphs
- Distance and eccentricity based invariants of windmill graph
- Graph products and eccentric harmonic index
- Further results on non-self-centrality measures of graphs
- Average geodesic distance of node-weighted Sierpinski networks
- Computing bounds for the general sum-connectivity index of some graph operations
- COMPARING THE SECOND MULTIPLICATIVE ZAGREB COINDEX WITH SOME GRAPH INVARIANTS
- Some bounds for topological efficiency of graphs
- Upper bounds of irregularity indices of categorical product of two connected graphs
- Bounds for the general sum-connectivity index of composite graphs
- Further results on Zagreb eccentricity coindices
- scientific article; zbMATH DE number 7653613 (Why is no real title available?)
- Upper bounds on the harmonic status index
- General eccentric distance sum of graphs with given diameter
- Further study on the second status connectivity index of graphs
- Enumeration of 2-factored dominating sets in fixed-width grid graphs
- Extremal trees of given segment sequence with respect to some eccentricity-based invariants
- Reformulated first Zagreb index of some graph operations
This page was built for publication: Computing the eccentric-distance sum for graph operations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2446873)
