版权说明 操作指南
首页 > 成果 > 详情

On eccentric distance sum and degree distance of graphs

认领
导出
Link by DOI
反馈
分享
QQ微信 微博
成果类型:
期刊论文
作者:
Hua, Hongbo*;Wang, Hongzhuan;Hu, Xiaolan
通讯作者:
Hua, Hongbo
作者机构:
[Wang, Hongzhuan; Hua, Hongbo] Huaiyin Inst Technol, Fac Math & Phys, Huaian 223003, Jiangsu, Peoples R China.
[Hu, Xiaolan] Cent China Normal Univ, Sch Math & Stat, Wuhan 430079, Hubei, Peoples R China.
通讯机构:
[Hua, Hongbo] H
Huaiyin Inst Technol, Fac Math & Phys, Huaian 223003, Jiangsu, Peoples R China.
语种:
英文
关键词:
Eccentric distance sum;Degree distance;Extremal problems;Difference;Bounds
期刊:
Discrete Applied Mathematics
ISSN:
0166-218X
年:
2018
卷:
250
页码:
262-275
基金类别:
Hua and Wang were supported by National Natural Science Foundation of China under Grant No. 11571135 . Hu was supported by National Natural Science Foundation of China under Grant No. 11601176 .
机构署名:
本校为其他机构
院系归属:
数学与统计学学院
摘要:
The eccentric distance sum (EDS) and degree distance (DD) are two distance-based graph invariants which have been well-studied in recent years. The study on relationships between various graph invariants has received much attention over the past few decades, and some of these research are associated with Graffiti conjectures (Fajtlowicz and Waller, 1987) or AutoGraphiX conjectures (Aouchiche et al., 2006). More recently, several groups of authors have investigated the relationships between several distance-based graph invariants along this line...

反馈

验证码:
看不清楚,换一个
确定
取消

成果认领

标题:
用户 作者 通讯作者
请选择
请选择
确定
取消

提示

该栏目需要登录且有访问权限才可以访问

如果您有访问权限,请直接 登录访问

如果您没有访问权限,请联系管理员申请开通

管理员联系邮箱:yun@hnwdkj.com