General eccentric distance sum of graphs

DOI10.1142/S1793830921500464zbMath1475.05060OpenAlexW3112581118MaRDI QIDQ5013504

Tomáš Vetrík

Publication date: 30 November 2021

Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s1793830921500464

zbMATH Keywords

eccentricityeccentric distance sumgeneral index

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Distance in graphs (05C12) Molecular structure (graph-theoretic methods, methods of differential topology, etc.) (92E10)

Related Items (1)

Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• On eccentric distance sum and minimum degree
• 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
• General eccentric connectivity index of trees and unicyclic graphs
• Eccentric distance sum: A novel graph invariant for predicting biological and physical properties
• On the maximum value of the eccentric distance sums of cubic transitive graphs
• On the minimum eccentric distance sum of bipartite graphs with some given parameters
• Extremal values on the eccentric distance sum of trees
• Computing the eccentric-distance sum for graph operations
• ECCENTRIC DISTANCE SUM OF SIERPIŃSKI GASKET AND SIERPIŃSKI NETWORK
• Gutman index, edge-Wiener index and edge-connectivity
• The eccentric-distance sum of some graphs
• On extremal bipartite graphs with given number of cut edges
• The minimum eccentric distance sum of trees with given distance k-domination number

This page was built for publication: General eccentric distance sum of graphs