The matching energy of graphs with given edge connectivity

被引：3

作者：

Ji, Shengjin ^{[1
,3
]}

Ma, Hongping ^{[2
]}

Ma, Gang ^{[1
]}

机构：

[1] Shangdong Univ Technol, Sch Sci, Zibo 255049, Shandong, Peoples R China

[2] Jiangsu Normal Univ, Sch Math & Stat, Xuzhou 221116, Jiangsu, Peoples R China

[3] Shandong Univ, Sch Math, Jinan 250100, Shandong, Peoples R China

来源：

JOURNAL OF INEQUALITIES AND APPLICATIONS | 2015年

基金：

中国国家自然科学基金; 中国博士后科学基金;

关键词：

matching energy; edge connectivity; graph energy; matching; extremal graph; MAXIMAL ENERGY; CONJECTURE; BOUNDS;

D O I：

10.1186/s13660-015-0938-3

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

Let G be a simple graph of order n and mu(1), mu(2),...,mu(n) the roots of its matching polynomial. The matching energy of G is defined as the sum Sigma(n)(i=1) vertical bar mu(i)vertical bar. Let K-n-1,1(k) be the graph obtained from K-1 boolean OR Kn-1 by adding k edges between V(K-1) and V(Kn-1). In this paper, we show that K-n-1,1(k) has the maximum matching energy among the connected graphs with order n and edge connectivity k.

引用

页码：1 / 9

页数：9

共 41 条

[1] NEW DEFINITION OF DEWAR-TYPE RESONANCE ENERGIES [J].

AIHARA, J .

JOURNAL OF THE AMERICAN CHEMICAL SOCIETY, 1976, 98 (10) :2750-2758

[2]

[Anonymous], ARXIV14117458

[3]

[Anonymous], 1975, MATCH COMMUN MATH CO

[4]

[Anonymous], SCI REP IN PRESS

[5]

Bondy J.A., 2008, GTM

[6]

Chen L, 2016, MATCH-COMMUN MATH CO, V75, P315

[7] Matching energy of unicyclic and bicyclic graphs with a given diameter [J].

Chen, Lin ;

Liu, Jinfeng ;

Shi, Yongtang .

COMPLEXITY, 2015, 21 (02) :224-238

[8]

Chen L, 2015, MATCH-COMMUN MATH CO, V73, P105

[9] The matching energy of random graphs [J].

Chen, Xiaolin ;

Li, Xueliang ;

Lian, Huishu .

DISCRETE APPLIED MATHEMATICS, 2015, 193 :102-109

[10]

CVETKOVIC D., 1988, ANN DISCRETE MATH, V36

← 1 2 3 4 5 →