The eccentric distance sum and degree distance have been well-studied in the past several years. More recently, many authors have considered the relationships between several distance-based graph invariants. Hua et al. (2018) investigated the relationship between the eccentric distance sum and the degree distance. In this paper, we present upper and lower bounds on ??d(G) ??? D???(G) among all connected graphs. The sharp lower and upper bounds on ??d(G)???D???(G) of general graphs with given connectivity (resp. edge number, number of cut edges, and matching number) are determined. In addition, we characterize the extremal graphs attaining those bounds. ?? 2022 Elsevier B.V. All rights reserved.
机构:
China Univ Min & Technol, Sch Math, Xuzhou 221116, Jiangsu, Peoples R ChinaChina Univ Min & Technol, Sch Math, Xuzhou 221116, Jiangsu, Peoples R China
Hong, Yunchao
Miao, Lianying
论文数: 0引用数: 0
h-index: 0
机构:
China Univ Min & Technol, Sch Math, Xuzhou 221116, Jiangsu, Peoples R ChinaChina Univ Min & Technol, Sch Math, Xuzhou 221116, Jiangsu, Peoples R China
机构:
Huaiyin Inst Technol, Fac Math & Phys, Huaian 223003, Jiangsu, Peoples R China
Northwestern Polytech Univ, Dept Appl Math, Xian 710072, Shaanxi, Peoples R ChinaHuaiyin Inst Technol, Fac Math & Phys, Huaian 223003, Jiangsu, Peoples R China
Hua, Hongbo
Zhang, Shenggui
论文数: 0引用数: 0
h-index: 0
机构:
Northwestern Polytech Univ, Dept Appl Math, Xian 710072, Shaanxi, Peoples R ChinaHuaiyin Inst Technol, Fac Math & Phys, Huaian 223003, Jiangsu, Peoples R China
机构:
College of Computer Science and Information Technology, Jazan University, Jazan, Saudi ArabiaCollege of Computer Science and Information Technology, Jazan University, Jazan, Saudi Arabia
Ahmad, Ali
López, S.C.
论文数: 0引用数: 0
h-index: 0
机构:
Departament de Matemàtica, Universitat de Lleida, Av. Pla de la Massa, Igualada 8,08700, SpainCollege of Computer Science and Information Technology, Jazan University, Jazan, Saudi Arabia