The maximum Mostar indices of unicyclic graphs with given diameter

被引：3
|
作者：
Liu, Guorong [1 ]
Deng, Kecai [1 ]
机构：
[1] Huaqiao Univ, Sch Math Sci, Quanzhou 362000, Fujian, Peoples R China
来源：
APPLIED MATHEMATICS AND COMPUTATION | 2023年 / 439卷
关键词：
Mostar index; Unicyclic graph; Diameter; DISTANCE-BALANCED GRAPHS; HEXAGONAL CHAINS; TREES;
D O I：
10.1016/j.amc.2022.127636
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
For an edge e = uv in a given graph G , let nuG (e ) be the number of vertices which have a less distance from u than that from v . Then |nuG (e)- nvG (e ) | is called the contribution of e . The Mostar index is defined as the sum of the edge contributions in G . In this paper, the unicyclic graphs with order n and diameter d, having the greatest Mostar index are determined. (c) 2022 Elsevier Inc. All rights reserved.
引用
收藏
页数：9
相关论文
共 50 条
12345