Maximizing signless Laplacian or adjacency spectral radius of graphs subject to fixed connectivity

In this paper, we characterize the graphs with maximum signless Laplacian or adjacency spectral radius among all graphs with fixed order and given vertex or edge connectivity. We also discuss the minimum signless Laplacian or adjacency spectral radius of graphs subject to fixed connectivity. Consequ...

Full description

Saved in:
Bibliographic Details
Published in:Linear algebra and its applications Vol. 433; no. 6; pp. 1180 - 1186
Main Authors: Ye, Miao-Lin, Fan, Yi-Zheng, Wang, Hai-Feng
Format: Journal Article
Language:English
Published: Amsterdam Elsevier Inc 01.11.2010
Elsevier
Subjects:
Adjacency matrix
Algebra
Applied sciences
Combinatorics
Combinatorics. Ordered structures
Connectivity
Exact sciences and technology
Flows in networks. Combinatorial problems
Graph
Graph theory
Linear and multilinear algebra, matrix theory
Mathematics
Operational research and scientific management
Operational research. Management science
Sciences and techniques of general use
Signless Laplacian matrix
Spectral radius
Graph
Signless Laplacian matrix
05C50
Spectral radius
05C40
Adjacency matrix
Connectivity
90C27
Perron value
Graph theory
Combinatorial optimization
Laplacian
Upper bound
ISSN:0024-3795
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Abstract In this paper, we characterize the graphs with maximum signless Laplacian or adjacency spectral radius among all graphs with fixed order and given vertex or edge connectivity. We also discuss the minimum signless Laplacian or adjacency spectral radius of graphs subject to fixed connectivity. Consequently we give an upper bound of signless Laplacian or adjacency spectral radius of graphs in terms of connectivity. In addition we confirm a conjecture of Aouchiche and Hansen involving adjacency spectral radius and connectivity.
AbstractList In this paper, we characterize the graphs with maximum signless Laplacian or adjacency spectral radius among all graphs with fixed order and given vertex or edge connectivity. We also discuss the minimum signless Laplacian or adjacency spectral radius of graphs subject to fixed connectivity. Consequently we give an upper bound of signless Laplacian or adjacency spectral radius of graphs in terms of connectivity. In addition we confirm a conjecture of Aouchiche and Hansen involving adjacency spectral radius and connectivity.
Author Wang, Hai-Feng
Fan, Yi-Zheng
Ye, Miao-Lin
Author_xml – sequence: 1
  givenname: Miao-Lin
  surname: Ye
  fullname: Ye, Miao-Lin
  email: yemiaolin@aqtc.edu.cn
  organization: School of Mathematical Sciences, Anhui University, Hefei 230039, PR China
– sequence: 2
  givenname: Yi-Zheng
  surname: Fan
  fullname: Fan, Yi-Zheng
  email: fanyz@ahu.edu.cn
  organization: School of Mathematical Sciences, Anhui University, Hefei 230039, PR China
– sequence: 3
  givenname: Hai-Feng
  surname: Wang
  fullname: Wang, Hai-Feng
  organization: School of Mathematics and Computation Sciences, Anqing Teachers College, Anqing 246011, PR China
BackLink http://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=23078173$$DView record in Pascal Francis
BookMark eNp9kD1rwzAQhjWk0CTtD-impWNSyZIjm04l9AtSumQXZ1lKzziykZyQ9NdXIaVDh8DBSaf3OdAzISPfeUvIHWdzzvjioZm3APOMpTuTqfIRGTOWyZlQZX5NJjE2jDGpWDYm1QcccIvf6Dc04sa3Nka6gr4Fg-BpFyjUDRjrzZHG3pohQEsD1LiLtHN0E6D_ijTuqia90aGjDg-2pqbzPg1wj8Pxhlw5aKO9_e1Tsn55Xi_fZqvP1_fl02pmRKaGGVQ1L5yopHAKqsJUosqlVALyqnbAIedCLBZlOhpbKsedzFjBmXF5Jgteiim5P6_tIRpoXQBvMOo-4BbCUWeCqYIrkXL8nDOhizFY9xfhTJ_86UYnf_rkTzOZKk-M-scYHGDAzicf2F4kH8-kTT_fow06Gkw2bY0hCdJ1hxfoHxUokDY
CODEN LAAPAW
CitedBy_id crossref_primary_10_1016_j_laa_2017_11_021
crossref_primary_10_1016_j_disc_2025_114544
crossref_primary_10_1016_j_amc_2017_02_018
crossref_primary_10_1016_j_laa_2017_01_019
crossref_primary_10_1016_j_laa_2019_07_010
crossref_primary_10_1080_09720502_2019_1643553
crossref_primary_10_1016_j_laa_2014_03_005
crossref_primary_10_1155_2021_7671212
crossref_primary_10_1016_j_dam_2025_06_019
crossref_primary_10_3390_math8060869
crossref_primary_10_1016_j_laa_2014_10_032
crossref_primary_10_1007_s10801_024_01357_4
crossref_primary_10_1016_j_laa_2011_11_015
crossref_primary_10_1016_j_laa_2017_10_026
crossref_primary_10_1016_j_laa_2019_04_013
crossref_primary_10_3390_math7010044
crossref_primary_10_1016_j_disc_2024_113948
crossref_primary_10_1016_j_laa_2014_11_010
Cites_doi 10.1016/j.dam.2009.06.023
10.1007/s10587-008-0082-z
10.1016/j.camwa.2009.04.005
10.1016/j.laa.2008.10.031
10.1016/j.laa.2009.06.015
10.1016/j.disc.2007.08.055
10.2298/PIM0999019C
10.1080/03081080701306589
10.1073/pnas.48.7.1142
10.3792/pjaa.84.163
10.1016/j.laa.2009.05.035
10.1016/j.laa.2009.02.017
10.1016/j.laa.2008.04.002
10.1016/j.laa.2009.06.029
10.1016/j.laa.2009.06.011
10.1080/03081089908818623
10.2298/PIM0999035F
10.1016/j.ejc.2006.07.004
10.1016/j.laa.2004.03.026
10.1016/S0024-3795(01)00538-9
10.1016/j.dam.2009.02.022
10.1016/j.laa.2008.05.017
10.1016/j.disc.2008.05.034
10.1016/j.laa.2009.05.020
10.1006/jctb.2001.2052
10.1016/j.laa.2007.01.009
10.1007/s00373-009-0840-1
ContentType Journal Article
Copyright 2010 Elsevier Inc.
2015 INIST-CNRS
Copyright_xml – notice: 2010 Elsevier Inc.
– notice: 2015 INIST-CNRS
DBID 6I.
AAFTH
AAYXX
CITATION
IQODW
DOI 10.1016/j.laa.2010.04.045
DatabaseName ScienceDirect Open Access Titles
Elsevier:ScienceDirect:Open Access
CrossRef
Pascal-Francis
DatabaseTitle CrossRef
DatabaseTitleList
DeliveryMethod fulltext_linktorsrc
Discipline Mathematics
Applied Sciences
EndPage 1186
ExternalDocumentID 23078173
10_1016_j_laa_2010_04_045
S0024379510002338
GroupedDBID --K
--M
--Z
-~X
.~1
0R~
0SF
1B1
1RT
1~.
1~5
4.4
457
4G.
5GY
5VS
6I.
6TJ
7-5
71M
8P~
9JN
AACTN
AAEDT
AAEDW
AAFTH
AAIKJ
AAKOC
AALRI
AAOAW
AAQFI
AASFE
AAXKI
AAXUO
ABAOU
ABFNM
ABJNI
ABMAC
ABVKL
ABXDB
ACDAQ
ACGFS
ACRLP
ADBBV
ADEZE
ADMUD
ADVLN
AEBSH
AEKER
AENEX
AEXQZ
AFKWA
AFTJW
AGHFR
AGUBO
AGYEJ
AHHHB
AIEXJ
AIGVJ
AIKHN
AITUG
AJOXV
AKRWK
ALMA_UNASSIGNED_HOLDINGS
AMFUW
AMRAJ
ARUGR
AXJTR
BKOJK
BLXMC
CS3
DU5
EBS
EFJIC
EO8
EO9
EP2
EP3
F5P
FDB
FEDTE
FIRID
FNPLU
FYGXN
G-Q
HVGLF
HZ~
IHE
IXB
J1W
KOM
M26
M41
MCRUF
MHUIS
MO0
N9A
NCXOZ
O-L
O9-
OAUVE
OK1
OZT
P-8
P-9
P2P
PC.
Q38
RIG
RNS
ROL
RPZ
SDF
SDG
SES
SPC
SPCBC
SSW
SSZ
T5K
TN5
TWZ
WH7
XPP
YQT
ZMT
~G-
29L
9DU
AAQXK
AATTM
AAYWO
AAYXX
ABDPE
ABEFU
ABWVN
ACLOT
ACRPL
ACVFH
ADCNI
ADIYS
ADNMO
AEIPS
AETEA
AEUPX
AFFNX
AFJKZ
AFPUW
AGQPQ
AIGII
AIIUN
AKBMS
AKYEP
ANKPU
APXCP
ASPBG
AVWKF
AZFZN
CITATION
EFKBS
EFLBG
EJD
FA8
FGOYB
G-2
GBLVA
MVM
OHT
R2-
SEW
T9H
WUQ
~HD
AFXIZ
AGCQF
AGRNS
BNPGV
IQODW
SSH
ID FETCH-LOGICAL-c327t-abd18f3b43f7ab8cb3b54473a5bdfa1a5133669fa1ce97f1f420810cf5248193
ISICitedReferencesCount 25
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000280857800011&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN 0024-3795
IngestDate Mon Jul 21 09:13:15 EDT 2025
Sat Nov 29 05:08:55 EST 2025
Tue Nov 18 22:11:22 EST 2025
Tue Dec 03 03:44:26 EST 2024
IsDoiOpenAccess true
IsOpenAccess true
IsPeerReviewed true
IsScholarly true
Issue 6
Keywords Graph
Signless Laplacian matrix
05C50
Spectral radius
05C40
Adjacency matrix
Connectivity
90C27
Perron value
Graph theory
Combinatorial optimization
Laplacian
Upper bound
Language English
License http://www.elsevier.com/open-access/userlicense/1.0
https://www.elsevier.com/tdm/userlicense/1.0
https://www.elsevier.com/open-access/userlicense/1.0
CC BY 4.0
LinkModel OpenURL
MergedId FETCHMERGED-LOGICAL-c327t-abd18f3b43f7ab8cb3b54473a5bdfa1a5133669fa1ce97f1f420810cf5248193
OpenAccessLink https://dx.doi.org/10.1016/j.laa.2010.04.045
PageCount 7
ParticipantIDs pascalfrancis_primary_23078173
crossref_primary_10_1016_j_laa_2010_04_045
crossref_citationtrail_10_1016_j_laa_2010_04_045
elsevier_sciencedirect_doi_10_1016_j_laa_2010_04_045
PublicationCentury 2000
PublicationDate 2010-11-01
PublicationDateYYYYMMDD 2010-11-01
PublicationDate_xml – month: 11
  year: 2010
  text: 2010-11-01
  day: 01
PublicationDecade 2010
PublicationPlace Amsterdam
PublicationPlace_xml – name: Amsterdam
PublicationTitle Linear algebra and its applications
PublicationYear 2010
Publisher Elsevier Inc
Elsevier
Publisher_xml – name: Elsevier Inc
– name: Elsevier
References Fan, Yang (bib10) 2009; 25
Wang, Huang, Belardo, Marzi (bib25) 2009; 431
Zhang, Li (bib29) 2002; 353
Cvetković, Rowlinson, Simić (bib9) 2007; 423
Liu, Liu (bib18) 2008; 58
Cardoso, Cvetković, Rowlinson, Simić (bib6) 2008; 429
Simić, Stanić (bib23) 2008; 308
Fan, Gong, Zhou, Tan, Wang (bib13) 2007; 28
Berman, Plemmons (bib3) 1994
Simić, Stanić (bib22) 2009; 58
de Freitas, de Abreu, Del-Vecchio, Jurkiewicz (bib15) 2010; 432
Harary (bib16) 1962; 48
Tam, Fan, Zhou (bib24) 2008; 429
Aouchiche, Hansen (bib1) 2010; 432
Omidi (bib21) 2009; 431
Fan, Gong, Wang, Gao (bib11) 2009; 309
Oliveira, de Lima, de Abreu, Hansen (bib19) 2010; 158
Cvetković, Simić (bib7) 2010; 432
Yu (bib27) 2008; 84
Zhang (bib28) 2009; 157
Ye, Fan, Liang (bib26) 2009; 430
Oliveira, de Lima, de Abreu, Kirkland (bib20) 2010; 432
Berman, Zhang (bib4) 2001; 83
Bapat, Grossman, Kulkarni (bib2) 1999; 46
Cai, Fan (bib5) 2009; 22
Fan, Tam, Zhou (bib12) 2008; 56
Feng, Yu (bib14) 2009; 85
Liu, Lu, Tian (bib17) 2004; 389
Cvetković, Simić (bib8) 2009; 85
Zhang (10.1016/j.laa.2010.04.045_bib29) 2002; 353
Oliveira (10.1016/j.laa.2010.04.045_bib19) 2010; 158
Ye (10.1016/j.laa.2010.04.045_bib26) 2009; 430
de Freitas (10.1016/j.laa.2010.04.045_bib15) 2010; 432
Liu (10.1016/j.laa.2010.04.045_bib17) 2004; 389
Berman (10.1016/j.laa.2010.04.045_bib3) 1994
Simić (10.1016/j.laa.2010.04.045_bib22) 2009; 58
Fan (10.1016/j.laa.2010.04.045_bib10) 2009; 25
Bapat (10.1016/j.laa.2010.04.045_bib2) 1999; 46
Cardoso (10.1016/j.laa.2010.04.045_bib6) 2008; 429
Cai (10.1016/j.laa.2010.04.045_bib5) 2009; 22
Zhang (10.1016/j.laa.2010.04.045_bib28) 2009; 157
Aouchiche (10.1016/j.laa.2010.04.045_bib1) 2010; 432
Cvetković (10.1016/j.laa.2010.04.045_bib8) 2009; 85
Cvetković (10.1016/j.laa.2010.04.045_bib7) 2010; 432
Harary (10.1016/j.laa.2010.04.045_bib16) 1962; 48
Simić (10.1016/j.laa.2010.04.045_bib23) 2008; 308
Oliveira (10.1016/j.laa.2010.04.045_bib20) 2010; 432
Wang (10.1016/j.laa.2010.04.045_bib25) 2009; 431
Berman (10.1016/j.laa.2010.04.045_bib4) 2001; 83
Tam (10.1016/j.laa.2010.04.045_bib24) 2008; 429
Fan (10.1016/j.laa.2010.04.045_bib11) 2009; 309
Fan (10.1016/j.laa.2010.04.045_bib13) 2007; 28
Liu (10.1016/j.laa.2010.04.045_bib18) 2008; 58
Yu (10.1016/j.laa.2010.04.045_bib27) 2008; 84
Fan (10.1016/j.laa.2010.04.045_bib12) 2008; 56
Feng (10.1016/j.laa.2010.04.045_bib14) 2009; 85
Cvetković (10.1016/j.laa.2010.04.045_bib9) 2007; 423
Omidi (10.1016/j.laa.2010.04.045_bib21) 2009; 431
References_xml – year: 1994
  ident: bib3
  article-title: Nonnegative Matrices in the Mathematical Sciences
– volume: 83
  start-page: 233
  year: 2001
  end-page: 240
  ident: bib4
  article-title: On the spectral radius of graphs with cut vertices
  publication-title: J. Combin. Theory Ser. B
– volume: 389
  start-page: 139
  year: 2004
  end-page: 145
  ident: bib17
  article-title: On the spectral radius of graphs with cut edges
  publication-title: Linear Algebra Appl.
– volume: 432
  start-page: 2257
  year: 2010
  end-page: 2272
  ident: bib7
  article-title: Towards a spectral theory of graphs based on the signless Laplacian, II
  publication-title: Linear Algebra Appl.
– volume: 430
  start-page: 1375
  year: 2009
  end-page: 1379
  ident: bib26
  article-title: The least eigenvalue of graphs with given connectivity
  publication-title: Linear Algebra Appl.
– volume: 56
  start-page: 381
  year: 2008
  end-page: 397
  ident: bib12
  article-title: Maximizing spectral radius of unoriented Laplacian matrix over bicyclic graphs of a given order
  publication-title: Linear and Multilinear Algebra
– volume: 423
  start-page: 155
  year: 2007
  end-page: 171
  ident: bib9
  article-title: Signless Laplacians of finite graphs
  publication-title: Linear Algebra Appl.
– volume: 431
  start-page: 162
  year: 2009
  end-page: 178
  ident: bib25
  article-title: On graphs whose signless Laplacian index does not exceed 4.5
  publication-title: Linear Algebra Appl.
– volume: 48
  start-page: 1142
  year: 1962
  end-page: 1146
  ident: bib16
  article-title: The maximum connectivity of a graph
  publication-title: Proc. Natl. Acad. Sci. USA
– volume: 84
  start-page: 163
  year: 2008
  end-page: 166
  ident: bib27
  article-title: On the maximal signless Laplacian spectral radius of graphs with given matching number
  publication-title: Proc. Japan Acad. Ser. A
– volume: 58
  start-page: 1233
  year: 2008
  end-page: 1240
  ident: bib18
  article-title: The maximum clique and the signless Laplacian eigenvalues
  publication-title: Czechoslovak Math. J.
– volume: 85
  start-page: 19
  year: 2009
  end-page: 33
  ident: bib8
  article-title: Towards a spectral theory of graphs based on the signless Laplacian, I
  publication-title: Publ. Inst. Math. (Beograd)
– volume: 308
  start-page: 4625
  year: 2008
  end-page: 4634
  ident: bib23
  article-title: -integral graphs with edgeCdegrees at most five
  publication-title: Discrete Math.
– volume: 58
  start-page: 171
  year: 2009
  end-page: 178
  ident: bib22
  article-title: On some forests determined by their Laplacian or signless Laplacian spectrum
  publication-title: Comput. Math. Appl.
– volume: 25
  start-page: 291
  year: 2009
  end-page: 298
  ident: bib10
  article-title: The signless Laplacian spectral radius of graphs with given number of pendant vertices
  publication-title: Graphs Combin.
– volume: 28
  start-page: 1694
  year: 2007
  end-page: 1702
  ident: bib13
  article-title: Nonsingular mixed graphs with few eigenvalues greater than two
  publication-title: European J. Combin.
– volume: 309
  start-page: 2479
  year: 2009
  end-page: 2487
  ident: bib11
  article-title: First eigenvalue and first eigenvectors of a nonsingular unicyclic mixed graph
  publication-title: Discrete Math.
– volume: 46
  start-page: 299
  year: 1999
  end-page: 312
  ident: bib2
  article-title: Generalized matrix tree theorem for mixed graphs
  publication-title: Linear and Multilinear Algebra
– volume: 432
  start-page: 2342
  year: 2010
  end-page: 2351
  ident: bib20
  article-title: Bounds on the
  publication-title: Linear Algebra Appl.
– volume: 22
  start-page: 161
  year: 2009
  end-page: 167
  ident: bib5
  article-title: The signless Laplacian spectral radius of graphs with given chromatic number
  publication-title: Appl. Math.
– volume: 158
  start-page: 355
  year: 2010
  end-page: 360
  ident: bib19
  article-title: Bounds on the index of the signless Laplacian of a graph
  publication-title: Discrete Appl. Math.
– volume: 85
  start-page: 35
  year: 2009
  end-page: 38
  ident: bib14
  article-title: On three conjectures involving the signless Laplacian spectral radius of graphs
  publication-title: Publ. Inst. Math. (Beograd)
– volume: 432
  start-page: 2293
  year: 2010
  end-page: 2322
  ident: bib1
  article-title: A survey of automated conjectures in spectral graph theory
  publication-title: Linear Algebra Appl.
– volume: 429
  start-page: 2770
  year: 2008
  end-page: 2780
  ident: bib6
  article-title: A sharp lower bound for the least eigenvalue of the signless Laplacian of a non-bipartite graph
  publication-title: Linear Algebra Appl.
– volume: 429
  start-page: 735
  year: 2008
  end-page: 758
  ident: bib24
  article-title: Unoriented Laplacian maximizing graphs are degree maximal
  publication-title: Linear Algebra Appl.
– volume: 157
  start-page: 2928
  year: 2009
  end-page: 2937
  ident: bib28
  article-title: The signless Laplacian spectral radius of graphs with given degree sequences
  publication-title: Discrete Appl. Math.
– volume: 431
  start-page: 1607
  year: 2009
  end-page: 1615
  ident: bib21
  article-title: On a signless Laplacian spectral characterization of T-shape trees
  publication-title: Linear Algebra Appl.
– volume: 353
  start-page: 11
  year: 2002
  end-page: 20
  ident: bib29
  article-title: The Laplacian spectrum of a mixed graph
  publication-title: Linear Algebra Appl.
– volume: 432
  start-page: 2352
  year: 2010
  end-page: 2360
  ident: bib15
  article-title: Infinite families of
  publication-title: Linear Algebra Appl.
– volume: 158
  start-page: 355
  year: 2010
  ident: 10.1016/j.laa.2010.04.045_bib19
  article-title: Bounds on the index of the signless Laplacian of a graph
  publication-title: Discrete Appl. Math.
  doi: 10.1016/j.dam.2009.06.023
– volume: 58
  start-page: 1233
  year: 2008
  ident: 10.1016/j.laa.2010.04.045_bib18
  article-title: The maximum clique and the signless Laplacian eigenvalues
  publication-title: Czechoslovak Math. J.
  doi: 10.1007/s10587-008-0082-z
– volume: 58
  start-page: 171
  year: 2009
  ident: 10.1016/j.laa.2010.04.045_bib22
  article-title: On some forests determined by their Laplacian or signless Laplacian spectrum
  publication-title: Comput. Math. Appl.
  doi: 10.1016/j.camwa.2009.04.005
– volume: 430
  start-page: 1375
  year: 2009
  ident: 10.1016/j.laa.2010.04.045_bib26
  article-title: The least eigenvalue of graphs with given connectivity
  publication-title: Linear Algebra Appl.
  doi: 10.1016/j.laa.2008.10.031
– volume: 432
  start-page: 2293
  year: 2010
  ident: 10.1016/j.laa.2010.04.045_bib1
  article-title: A survey of automated conjectures in spectral graph theory
  publication-title: Linear Algebra Appl.
  doi: 10.1016/j.laa.2009.06.015
– volume: 308
  start-page: 4625
  year: 2008
  ident: 10.1016/j.laa.2010.04.045_bib23
  article-title: Q-integral graphs with edgeCdegrees at most five
  publication-title: Discrete Math.
  doi: 10.1016/j.disc.2007.08.055
– volume: 85
  start-page: 19
  issue: 99
  year: 2009
  ident: 10.1016/j.laa.2010.04.045_bib8
  article-title: Towards a spectral theory of graphs based on the signless Laplacian, I
  publication-title: Publ. Inst. Math. (Beograd)
  doi: 10.2298/PIM0999019C
– volume: 56
  start-page: 381
  year: 2008
  ident: 10.1016/j.laa.2010.04.045_bib12
  article-title: Maximizing spectral radius of unoriented Laplacian matrix over bicyclic graphs of a given order
  publication-title: Linear and Multilinear Algebra
  doi: 10.1080/03081080701306589
– volume: 48
  start-page: 1142
  year: 1962
  ident: 10.1016/j.laa.2010.04.045_bib16
  article-title: The maximum connectivity of a graph
  publication-title: Proc. Natl. Acad. Sci. USA
  doi: 10.1073/pnas.48.7.1142
– volume: 22
  start-page: 161
  year: 2009
  ident: 10.1016/j.laa.2010.04.045_bib5
  article-title: The signless Laplacian spectral radius of graphs with given chromatic number
  publication-title: Appl. Math.
– volume: 84
  start-page: 163
  year: 2008
  ident: 10.1016/j.laa.2010.04.045_bib27
  article-title: On the maximal signless Laplacian spectral radius of graphs with given matching number
  publication-title: Proc. Japan Acad. Ser. A
  doi: 10.3792/pjaa.84.163
– volume: 431
  start-page: 1607
  year: 2009
  ident: 10.1016/j.laa.2010.04.045_bib21
  article-title: On a signless Laplacian spectral characterization of T-shape trees
  publication-title: Linear Algebra Appl.
  doi: 10.1016/j.laa.2009.05.035
– volume: 431
  start-page: 162
  year: 2009
  ident: 10.1016/j.laa.2010.04.045_bib25
  article-title: On graphs whose signless Laplacian index does not exceed 4.5
  publication-title: Linear Algebra Appl.
  doi: 10.1016/j.laa.2009.02.017
– volume: 429
  start-page: 735
  year: 2008
  ident: 10.1016/j.laa.2010.04.045_bib24
  article-title: Unoriented Laplacian maximizing graphs are degree maximal
  publication-title: Linear Algebra Appl.
  doi: 10.1016/j.laa.2008.04.002
– volume: 432
  start-page: 2352
  year: 2010
  ident: 10.1016/j.laa.2010.04.045_bib15
  article-title: Infinite families of Q-integral graphs
  publication-title: Linear Algebra Appl.
  doi: 10.1016/j.laa.2009.06.029
– year: 1994
  ident: 10.1016/j.laa.2010.04.045_bib3
– volume: 432
  start-page: 2342
  year: 2010
  ident: 10.1016/j.laa.2010.04.045_bib20
  article-title: Bounds on the Q-spread of a graph
  publication-title: Linear Algebra Appl.
  doi: 10.1016/j.laa.2009.06.011
– volume: 46
  start-page: 299
  year: 1999
  ident: 10.1016/j.laa.2010.04.045_bib2
  article-title: Generalized matrix tree theorem for mixed graphs
  publication-title: Linear and Multilinear Algebra
  doi: 10.1080/03081089908818623
– volume: 85
  start-page: 35
  year: 2009
  ident: 10.1016/j.laa.2010.04.045_bib14
  article-title: On three conjectures involving the signless Laplacian spectral radius of graphs
  publication-title: Publ. Inst. Math. (Beograd)
  doi: 10.2298/PIM0999035F
– volume: 28
  start-page: 1694
  year: 2007
  ident: 10.1016/j.laa.2010.04.045_bib13
  article-title: Nonsingular mixed graphs with few eigenvalues greater than two
  publication-title: European J. Combin.
  doi: 10.1016/j.ejc.2006.07.004
– volume: 389
  start-page: 139
  year: 2004
  ident: 10.1016/j.laa.2010.04.045_bib17
  article-title: On the spectral radius of graphs with cut edges
  publication-title: Linear Algebra Appl.
  doi: 10.1016/j.laa.2004.03.026
– volume: 353
  start-page: 11
  year: 2002
  ident: 10.1016/j.laa.2010.04.045_bib29
  article-title: The Laplacian spectrum of a mixed graph
  publication-title: Linear Algebra Appl.
  doi: 10.1016/S0024-3795(01)00538-9
– volume: 157
  start-page: 2928
  year: 2009
  ident: 10.1016/j.laa.2010.04.045_bib28
  article-title: The signless Laplacian spectral radius of graphs with given degree sequences
  publication-title: Discrete Appl. Math.
  doi: 10.1016/j.dam.2009.02.022
– volume: 429
  start-page: 2770
  year: 2008
  ident: 10.1016/j.laa.2010.04.045_bib6
  article-title: A sharp lower bound for the least eigenvalue of the signless Laplacian of a non-bipartite graph
  publication-title: Linear Algebra Appl.
  doi: 10.1016/j.laa.2008.05.017
– volume: 309
  start-page: 2479
  year: 2009
  ident: 10.1016/j.laa.2010.04.045_bib11
  article-title: First eigenvalue and first eigenvectors of a nonsingular unicyclic mixed graph
  publication-title: Discrete Math.
  doi: 10.1016/j.disc.2008.05.034
– volume: 432
  start-page: 2257
  year: 2010
  ident: 10.1016/j.laa.2010.04.045_bib7
  article-title: Towards a spectral theory of graphs based on the signless Laplacian, II
  publication-title: Linear Algebra Appl.
  doi: 10.1016/j.laa.2009.05.020
– volume: 83
  start-page: 233
  year: 2001
  ident: 10.1016/j.laa.2010.04.045_bib4
  article-title: On the spectral radius of graphs with cut vertices
  publication-title: J. Combin. Theory Ser. B
  doi: 10.1006/jctb.2001.2052
– volume: 423
  start-page: 155
  year: 2007
  ident: 10.1016/j.laa.2010.04.045_bib9
  article-title: Signless Laplacians of finite graphs
  publication-title: Linear Algebra Appl.
  doi: 10.1016/j.laa.2007.01.009
– volume: 25
  start-page: 291
  year: 2009
  ident: 10.1016/j.laa.2010.04.045_bib10
  article-title: The signless Laplacian spectral radius of graphs with given number of pendant vertices
  publication-title: Graphs Combin.
  doi: 10.1007/s00373-009-0840-1
SSID ssj0004702
Score 2.0801451
Snippet In this paper, we characterize the graphs with maximum signless Laplacian or adjacency spectral radius among all graphs with fixed order and given vertex or...
SourceID pascalfrancis
crossref
elsevier
SourceType Index Database
Enrichment Source
Publisher
StartPage 1180
SubjectTerms Adjacency matrix
Algebra
Applied sciences
Combinatorics
Combinatorics. Ordered structures
Connectivity
Exact sciences and technology
Flows in networks. Combinatorial problems
Graph
Graph theory
Linear and multilinear algebra, matrix theory
Mathematics
Operational research and scientific management
Operational research. Management science
Sciences and techniques of general use
Signless Laplacian matrix
Spectral radius
Title Maximizing signless Laplacian or adjacency spectral radius of graphs subject to fixed connectivity
URI https://dx.doi.org/10.1016/j.laa.2010.04.045
Volume 433
WOSCitedRecordID wos000280857800011&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
journalDatabaseRights – providerCode: PRVESC
  databaseName: Elsevier SD Freedom Collection Journals 2021
  issn: 0024-3795
  databaseCode: AIEXJ
  dateStart: 19950101
  customDbUrl:
  isFulltext: true
  dateEnd: 20180131
  titleUrlDefault: https://www.sciencedirect.com
  omitProxy: false
  ssIdentifier: ssj0004702
  providerName: Elsevier
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV3di9QwEA_rng-KiJ94fhx58EmptGnatI-H3HLK3SG4D6svJUkbr8vaXba7x-KL_7qTj6Zd0UMFoZQ2bNOl88tkMvnNDEIvkyjjeVxGGrwkgJEYBVwRHpAUrFee54pIYYpNsIuLbDbLP4xG37tYmKsFa5pst8tX_1XU0AbC1qGzfyFu3yk0wDUIHc4gdjj_keDP-a7-Wn8zfoL6S7PQquyMa-6VHsuaM1nOuTQRlybMUkfor3lZbw2pwySwbl-3W6EdNNoyVfWu0qFvoJClLTUxNGhhLatTAelqIbDu9lsRw33x3i1refp8GZzVHpMT64H9VAefLys3jRoHv1VCp7wOJl27805opseed8KHzeyxOrVhAOCw1TU7NUxtQgyHt6FS1VnqBhM03Ka_VP7WDzF_s-DccfYoHEk_03n-4UeXiDGJTMKfOLuBDghL8myMDo7fncze96G1LHQJ5-0_7jbGDUXwpxf9zrS5s-ItDDhlK6UMzJfpPXTXrTvwscXLfTSqmgfo9rlP2ts-RKJHDu6Qgz1y8HKNPXJwhxxskYOXClvkYIccvFligxw8RM4jNJ2cTN-eBq4ERyBjwjYBF2WUqVjQWDEuMilikVDKYp6IUvGI6-pAaZrDpaxypiKl2RpRKFVCKNia8WM0bpZN9QThVFHGWclJRVMaSljnU5hmQyKJyKAzeYjC7uMV0qWn11VSFkXHQ5wX8L0L_b2LkMKRHKJX_pGVzc1y3Y9pJ5HCGZfWaCwAPtc9drQnPf8iHUCRRSx--m_9PkO3-uHyHI036231At2UV5u6XR85FP4A4t2qhg
linkProvider Elsevier
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Maximizing+signless+Laplacian+or+adjacency+spectral+radius+of+graphs+subject+to+fixed+connectivity&rft.jtitle=Linear+algebra+and+its+applications&rft.au=Ye%2C+Miao-Lin&rft.au=Fan%2C+Yi-Zheng&rft.au=Wang%2C+Hai-Feng&rft.date=2010-11-01&rft.pub=Elsevier+Inc&rft.issn=0024-3795&rft.volume=433&rft.issue=6&rft.spage=1180&rft.epage=1186&rft_id=info:doi/10.1016%2Fj.laa.2010.04.045&rft.externalDocID=S0024379510002338
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0024-3795&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0024-3795&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0024-3795&client=summon