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...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	Linear algebra and its applications Ročník 433; číslo 6; s. 1180 - 1186
Hlavní autoři:	Ye, Miao-Lin, Fan, Yi-Zheng, Wang, Hai-Feng
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Amsterdam Elsevier Inc 01.11.2010 Elsevier
Témata:	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
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Buďte první, kdo okomentuje tento záznam!