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

On the (n, m)-graphs with minimum degree resistance distance

认领
导出
反馈
分享
QQ微信 微博
成果类型:
期刊论文
作者:
Chen, Shubo*;Guo, Zhijun;Xia, Fangli;Yang, Jianguang
通讯作者:
Chen, Shubo
作者机构:
[Yang, Jianguang; Xia, Fangli; Guo, Zhijun; Chen, Shubo] Hunan City Univ, Sch Math, Yiyang 413000, Hunan, Peoples R China.
[Chen, Shubo] Hunan Univ, Coll Math, Changsha 410082, Hunan, Peoples R China.
通讯机构:
[Chen, Shubo] H
Hunan City Univ, Sch Math, Yiyang 413000, Hunan, Peoples R China.
Hunan Univ, Coll Math, Changsha 410082, Hunan, Peoples R China.
语种:
英文
关键词:
Resistance distance;Degree resistance distance;(n,m)-graph
期刊:
Utilitas Mathematica
ISSN:
0315-3681
年:
2017
卷:
102
页码:
75-86
基金类别:
National Natural Science Foundation of ChinaNational Natural Science Foundation of China (NSFC) [11401192]; Natural Science Foundation of Hunan ProvinceNatural Science Foundation of Hunan Province [2015JJ3031]; Scientific Research Fund of Hunan Provincial Education DepartmentHunan Provincial Education Department [14A026, 14CO225, 15CO248]
机构署名:
本校为第一且通讯机构
院系归属:
理学院
摘要:
The resistance distance r(u, v) between two vertices u, v of a connected graph G is defined as the effective resistance between them in the corresponding electrical network, constructed from G by replacing each edge of G with a unit resistor. The degree resistance distance of G is defined as D-R(G) = Sigma({u, v}subset of) (V(G)) (d(u) + d(upsilon)) r(u, v), where d(u) is the degree of the vertex u. Let G(n,m) be the set of connected graphs with order n and m edges. In this paper, we'll determine the extremal grap...

反馈

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

成果认领

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

提示

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

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

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

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