Extremal bicyclic graphs with respect to Mostar index

被引：54

作者：

Tepeh, Aleksandra ^{[1
,2
]}

机构：

[1] Univ Maribor, Fac Elect Engn & Comp Sci, Koroska Cesta 46, Maribor 2000, Slovenia

[2] Fac Informat Studies, Ljubljanska Cesta 31a, Novo Mesto 8000, Slovenia

来源：

APPLIED MATHEMATICS AND COMPUTATION | 2019年 / 355卷

关键词：

Mostar index; Bond-additive index; Bicyclic graphs; MATHEMATICAL ASPECTS;

D O I：

10.1016/j.amc.2019.03.014

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

For an edge uv of a graph G, n(u) denotes the number of vertices of G closer to u than to v, and similarly n(v) is the number of vertices closer to v than to u. The Mostar index of a graph G is defined as the sum of absolute differences between n(u) and n(v) over all edges uv of G. In the paper we prove a recent conjecture of Doslic et al. (2018) on a characterization of bicyclic graphs with given number of vertices, for which extremal values of Mostar index are attained. (C) 2019 Elsevier Inc. All rights reserved.

引用

页码：319 / 324

页数：6

共 14 条

[1] Mostar index [J].