Some further results on the eccentric distance sum
From MaRDI portal
Publication:1799765
DOI10.1016/J.JMAA.2018.09.059zbMATH Open1397.05048OpenAlexW2895266932WikidataQ129145802 ScholiaQ129145802MaRDI QIDQ1799765FDOQ1799765
Authors: Ziwen Huang, Xiaozhong Xi, Shaoliang Yuan 
Publication date: 19 October 2018
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.2018.09.059
Recommendations
- Further results on the eccentric distance sum
- scientific article; zbMATH DE number 6101323
- A short and unified proof of Yu et al.'s two results on the eccentric distance sum
- On eccentric distance sum and minimum degree
- The eccentric-distance sum of some graphs
- On the eccentric distance sum of graphs
- Further results regarding the sum of domination number and average eccentricity
- Further results on the sum of squares of eccentricity of graphs
- On eccentric distance sum and degree distance of graphs
- General eccentric distance sum of graphs
Cites Work
- Graph theory
- Extremal values on the eccentric distance sum of trees
- Wiener index of trees: Theory and applications
- Computing the eccentric-distance sum for graph operations
- On the extreme eccentric distance sum of graphs with some given parameters
- Title not available (Why is that?)
- On Moore Graphs with Diameters 2 and 3
- Title not available (Why is that?)
- Title not available (Why is that?)
- On the eccentric distance sum of graphs
- On the extremal values of the eccentric distance sum of trees
- On the eccentric distance sum of trees and unicyclic graphs
- Further results on the eccentric distance sum
- On the oriented chromatic number of Halin graphs
- The 2-dipath chromatic number of Halin graphs
- Über simpliziale Zerfällungen beliebiger (endlicher oder unendlicher) Graphen
- Edge-face total chromatic number of Halin graphs
- The strong chromatic index of Halin graphs
- Group chromatic number of Halin graphs
- Acyclic chromatic index of fully subdivided graphs and Halin graphs
- Title not available (Why is that?)
- Eccentric distance sum: A novel graph invariant for predicting biological and physical properties
- On the minimum eccentric distance sum of bipartite graphs with some given parameters
- On the extremal values of the eccentric distance sum of trees
- On the spectral radius of bipartite graphs with given diameter
- A short and unified proof of Yu et al.'s two results on the eccentric distance sum
- Graphs of diameter two with no 4-circuits
- Edges in graphs with large girth
Cited In (13)
- On the minimum eccentric distance sum of bipartite graphs with some given parameters
- ECCENTRIC DISTANCE SUM OF SUBSTITUTION TREE NETWORKS
- Further results regarding the sum of domination number and average eccentricity
- On the extreme eccentric distance sum of graphs with some given parameters
- General eccentric distance sum of graphs
- Further results on the eccentric distance sum
- Title not available (Why is that?)
- The expected values for the Kirchhoff indices in the random cyclooctatetraene and spiro chains
- General eccentric distance sum of graphs with given diameter
- Connectivity, diameter, minimal degree, independence number and the eccentric distance sum of graphs
- Extremal trees of given segment sequence with respect to some eccentricity-based invariants
- Bounds on the general eccentric distance sum of graphs
- The expected values for the Schultz index, Gutman index, multiplicative degree-Kirchhoff index and additive degree-Kirchhoff index of a random polyphenylene chain
This page was built for publication: Some further results on the eccentric distance sum
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1799765)
