Paper Info
Title
On The (Signless Laplacian) Spectral Radius Of Minimally K-(Edge)-Connected Graphs For Small K
Abstract
A graph is minimally k-(edge)-connected if it is k-connected (respectively, k-edge-connected) and deleting any arbitrary chosen edge always leaves a graph which is not k-connected (respectively, k-edge-connected). What is the maximum (signless Laplacian) spectral radius and what are the corresponding extremal graphs among minimally k-(edge)-connected graphs for k >= 2? Chen and Guo (2019) gave the answer to k = 2 and characterized the corresponding extremal graphs. In this paper, we first give the answer to k = 3 for minimally 3-connected graphs. For the signless Laplacian spectral radius, we also consider the problem for k = 2, 3 and characterize the extremal graphs. (C) 2021 Elsevier B.V. All rights reserved.
Year
DOI
Venue
2021
10.1016/j.dam.2021.09.002
DISCRETE APPLIED MATHEMATICS
Keywords
DocType
Volume
Minimally 2-(edge)-connected graph, Minimally 3-connected graph, Spectral radius
Journal
305
ISSN
Citations 
PageRank 
0166-218X
0
0.34
References 
Authors
0
3
Name
Order
Citations
PageRank
Dandan Fan122.60
Sergey Goryainov211.04
Huiqiu Lin33411.56