On minimally 2-(edge)-connected graphs with extremal spectral radius

被引：8

作者：

Chen, Xiaodan ^{[1
]}

Guo, Litao ^{[2
]}

机构：

[1] Guangxi Univ, Coll Math & Informat Sci, Nanning 530004, Guangxi, Peoples R China

[2] Xiamen Univ Technol, Sch Appl Math, Xiamen 361024, Fujian, Peoples R China

来源：

DISCRETE MATHEMATICS | 2019年 / 342卷 / 07期

基金：

中国国家自然科学基金;

关键词：

Minimally 2-connected graph; Minimally 2-edge-connected graph; Spectral radius; Extremal graph; CONJECTURES; EIGENVALUES; TREES;

D O I：

10.1016/j.disc.2019.04.002

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

A graph is minimally 2-(edge)-connected if it is 2-(edge)-connected and deleting any arbitrary chosen edge always leaves a graph which is not 2-(edge)-connected. In this paper, we completely characterize the minimally 2-(edge)-connected graphs having the largest and the smallest spectral radius, respectively. (C) 2019 Elsevier B.V. All rights reserved.

引用

页码：2092 / 2099

页数：8

共 30 条

[1] Babai L, 2009, ELECTRON J COMB, V16
[2] On the spectral radius of graphs with cut vertices
Berman, A
Zhang, XD
[J]. JOURNAL OF COMBINATORIAL THEORY SERIES B, 2001, 83 (02) : 233 - 240
[3] Bondy J.A., 2008, GTM, V244
[4] ON THE SPECTRAL-RADIUS OF COMPLEMENTARY ACYCLIC MATRICES OF ZEROS AND ONES
BRUALDI, RA
SOLHEID, ES
[J]. SIAM JOURNAL ON ALGEBRAIC AND DISCRETE METHODS, 1986, 7 (02): : 265 - 272
[5] On the index of bicyclic graphs with perfect matchings
Chang, A
Tian, F
Yu, AM
[J]. DISCRETE MATHEMATICS, 2004, 283 (1-3) : 51 - 59
[6] On the spectral radius of unicyclic graphs with perfect matchings
Chang, A
Tian, F
[J]. LINEAR ALGEBRA AND ITS APPLICATIONS, 2003, 370 : 237 - 250
[7] Collatz L., 1957, Abh Math Sem Univ Hamburg, V21, P63, DOI [10.1007/BF02941924, DOI 10.1007/BF02941924]
[8] Cvetkovic D.M., 1980, SPECTRA GRAPHS
[9] Proof of conjectures on adjacency eigenvalues of graphs
Das, Kinkar Ch
[J]. DISCRETE MATHEMATICS, 2013, 313 (01) : 19 - 25
[10] DIRAC GA, 1967, J REINE ANGEW MATH, V228, P204

← 1 2 3 →