Connectivity, diameter, minimal degree, independence number and the eccentric distance sum of graphs
type: Item
instance of: scholarly article
title: Connectivity, diameter, minimal degree, independence number and the eccentric distance sum of graphs
zbMATH Open document ID: 1394.05023
author: Shuya Chen
author: Shuchao Li
author: Yueyu Wu
author: Lingli Sun
published in: Discrete Applied Mathematics
publication date: 2018-09-06T00:00:00Z
Mathematics Subject Classification ID: 05C12
Mathematics Subject Classification ID: 05C40
zbMATH DE Number: 6933508
zbMATH Keywords: eccentric distance sum
zbMATH Keywords: \(k\)-connected
zbMATH Keywords: connectivity
zbMATH Keywords: minimum degree
zbMATH Keywords: independence number
MaRDI profile type: Publication
full work available at URL: j.dam.2018.03.057
OpenAlex ID: W2797552901
cites work: Q5422499
cites work: Extremal values on the eccentric distance sum of trees
cites work: Eccentric distance sum: A novel graph invariant for predicting biological and physical properties
cites work: Further results on the eccentric distance sum
cites work: Maximizing the spectral radius of \(k\)-connected graphs with given diameter
cites work: On the eccentric distance sum of graphs
cites work: On the extreme eccentric distance sum of graphs with some given parameters
cites work: On the minimum eccentric distance sum of bipartite graphs with some given parameters
cites work: On the extremal values of the eccentric distance sum of trees
cites work: On the extremal values of the eccentric distance sum of trees with a given domination number
cites work: On eccentric distance sum and minimum degree
cites work: On the eccentric distance sum of trees and unicyclic graphs
cites work: Connectivity, diameter, independence number and the distance spectral radius of graphs
DOI: 10.1016/J.DAM.2018.03.057
description: scientific article; zbMATH DE number 6933508