Minimum general sum-connectivity index of trees and unicyclic graphs having a given matching number

被引：16

作者：

Jamil, Muhammad Kamran ^{[1
]}

Tomescu, Ioan ^{[2
]}

机构：

[1] Riphah Int Univ, Riphah Inst Comp & Appl Sci, Dept Math, 14 Ali Rd, Lahore, Pakistan

[2] Univ Bucharest, Fac Math & Comp Sci, Str Acad 14, Bucharest 010014, Romania

来源：

DISCRETE APPLIED MATHEMATICS | 2017年 / 222卷

关键词：

General sum-connectivity index; Tree; Unicyclic graph; Matching number; Perfect matching; Jensen's inequality; Convex function; Taylor series;

D O I：

10.1016/j.dam.2017.01.020

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

In this paper it is shown that the characterizations of trees and unicyclic graphs having a given matching number and minimum connectivity index chi(-1/2), proposed by Du et al. (2010) remain valid for general connectivity index chi(alpha) if -1 <= alpha < 0 for trees and 0.585 <= alpha < 0 for unicyclic graphs. The extremal result for trees having a given matching number is also true for the harmonic index H, since for any graph H(G) = 2 chi(-1)(G) holds. (C) 2017 Elsevier B.V. All rights reserved.

引用

页码：143 / 150

页数：8

共 10 条

[1]

[Anonymous], MATCH COMMUN COMPUT

[2]

Bondy A., 2008, GRAPH THEORY

[3] PERMANENT OF THE LAPLACIAN MATRIX OF TREES AND BIPARTITE GRAPHS [J].