On L-Borderenergetic Graphs with Maximum Degree at Most 4

被引：0

作者：

Deng, Bo ^{[1
]}

Li, Xueliang

机构：

[1] Nankai Univ, Ctr Combinator, Tianjin 300071, Peoples R China

来源：

MATCH-COMMUNICATIONS IN MATHEMATICAL AND IN COMPUTER CHEMISTRY | 2018年 / 79卷 / 02期

关键词：

LAPLACIAN ENERGY; COMPUTER-SEARCH; ORDER; 10; NUMBER;

D O I：

暂无

中图分类号：

O6 [化学];

学科分类号：

0703 ;

摘要：

If a graph G of order n has the same Laplacian energy as the complete graph K-n does, i.e., if L epsilon(G) = 2(n-1), then G is said to be L-borderenergetic. In this paper, we first prove that there are no 2-connected L-borderenergetic graphs of order n >= 5 with maximum degree Delta = 3, which improves the result in [B. Deng, X. Li, J. Wang, Further results on L-Borderenergetic Graphs, MATCH Commun. Math. Comput. Chem., 77(2017)607-616]. Then by surveying the L-borderenergetic graphs with maximum degree Delta = 4, we present two asymptotically tight bounds on their sizes.

引用

页码：303 / 310

页数：8

共 28 条

[1]

Akbari S, 2009, MATCH-COMMUN MATH CO, V61, P361

[2]

[Anonymous], 2012, Graph Energy

[3]

[Anonymous], 2009, Analysis of Complex Networks: From Biology to Linguistics, DOI DOI 10.1002/9783527627981.CH7

[4]

[Anonymous], 2009, An Introduction to the Theory of Graph Spectra

[5]

Bonchev D.G., 2003, COMPLEXITY INTRO FUN, V7

[6]

Deng B, 2017, MATCH-COMMUN MATH CO, V77, P607

[7]

Deng B, 2017, MATCH-COMMUN MATH CO, V77, P115

[8] More on borderenergetic graphs [J].

Deng, Bo ;

Li, Xueliang ;

Gutman, Ivan .

LINEAR ALGEBRA AND ITS APPLICATIONS, 2016, 497 :199-208

[9]

Gong SC, 2015, MATCH-COMMUN MATH CO, V74, P321

[10] Laplacian energy of a graph [J].

Gutman, I ;

Zhou, B .

LINEAR ALGEBRA AND ITS APPLICATIONS, 2006, 414 (01) :29-37

← 1 2 3 →