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

Maximizing and Minimizing Multiplicative Zagreb Indices of Graphs Subject to Given Number of Cut Edges

认领
导出
Link by DOI
反馈
分享
QQ微信 微博
成果类型:
期刊论文
作者:
Wang, Shaohui*;Wang, Chunxiang;Chen, Lin;Liu, Jia-Bao;Shao, Zehui
通讯作者:
Wang, Shaohui
作者机构:
[Wang, Shaohui] Savannah State Univ, Dept Math, Savannah, GA 31419 USA.
[Chen, Lin; Wang, Chunxiang] Cent China Normal Univ, Sch Math & Stat, Wuhan 430079, Hubei, Peoples R China.
[Chen, Lin; Wang, Chunxiang] Cent China Normal Univ, Hubei Key Lab Math Sci, Wuhan 430079, Hubei, Peoples R China.
[Liu, Jia-Bao] Anhui Jianzhu Univ, Sch Math & Phys, Hefei 230601, Anhui, Peoples R China.
[Shao, Zehui] Guangzhou Univ, Inst Comp Sci & Technol, Guangzhou 510006, Guangdong, Peoples R China.
通讯机构:
[Wang, Shaohui] S
Savannah State Univ, Dept Math, Savannah, GA 31419 USA.
语种:
英文
关键词:
Cut edge;Extremal values;Graph transformation;Multiplicative zagreb indices
期刊:
Mathematics
ISSN:
2227-7390
年:
2018
卷:
6
期:
11
基金类别:
National Natural Science Foundation of ChinaNational Natural Science Foundation of China (NSFC) [11771172, 11571134]; Anhui Province Key Laboratory of Intelligent Building & Building Energy Saving
机构署名:
本校为其他机构
院系归属:
数学与统计学学院
摘要:
Given a (molecular) graph, the first multiplicative Zagreb index Π 1 is considered to be the product of squares of the degree of its vertices, while the second multiplicative Zagreb index P2 is expressed as the product of endvertex degree of each edge over all edges. We consider a set of graphs G n,k having n vertices and k cut edges, and explore the graphs subject to a number of cut edges. In addition, the maximum and minimum multiplicative Zagreb indices of graphs in G n,k are provided. We also provide these graphs with the largest...

反馈

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

成果认领

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

提示

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

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

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

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