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

Graphs with maximal Hosoya index and minimal Merrifield–Simmons index

认领
导出
Link by DOI
反馈
分享
QQ微信 微博
成果类型:
期刊论文
作者:
Zhu, Zhongxun*;Yuan, Cao;Andriantiana, Eric Ould Dadah;Wagner, Stephan
通讯作者:
Zhu, Zhongxun
作者机构:
[Zhu, Zhongxun] South Cent Univ Natiolalities, Coll Math & Stat, Wuhan 430074, Peoples R China.
[Yuan, Cao] Wuhan Polytech Univ, Dept Comp & Informat Engn, Wuhan 430023, Peoples R China.
[Andriantiana, Eric Ould Dadah] Rhodes Univ, Dept Math Pure & Appl, ZA-6140 Grahamstown, South Africa.
[Wagner, Stephan] Univ Stellenbosch, Dept Math Sci, ZA-7602 Matieland, South Africa.
通讯机构:
[Zhu, Zhongxun] S
South Cent Univ Natiolalities, Coll Math & Stat, Wuhan 430074, Peoples R China.
语种:
英文
关键词:
Hosoya index;Matching number;Merrifield-Simmons index;Vertex connectivity
期刊:
Discrete Mathematics
ISSN:
0012-365X
年:
2014
卷:
329
页码:
77-87
基金类别:
This project was supported by the Special Fund for Basic Scientific Research of Central Colleges , South-Central University for Nationalities ( CZZ13006 ). The fourth author was supported by the National Research Foundation of South Africa , grant number 70560 .
机构署名:
本校为其他机构
院系归属:
数学与计算机学院
摘要:
For a graph G, the Hosoya index and the Merrifield-Simmons index are defined as the total number of its matchings and the total number of its independent sets, respectively. In this paper, we characterize the structure of those graphs that minimize the Merrifield-Simmons index and those that maximize the Hosoya index in two classes of simple connected graphs with n vertices: graphs with fixed matching number and graphs with fixed connec...

反馈

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

成果认领

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

提示

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

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

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

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