Connectivity, toughness, spanning trees of bounded degree, and the spectrum of regular graphs

Title:

Connectivity, toughness, spanning trees of bounded degree, and the spectrum of regular graphs

Creator:

Cioabă, Sebastian M and Gu, Xiaofeng

Identifier:

https://cdk.lib.cas.cz/client/handle/uuid:aa72f23f-4c13-400a-b998-107151a3774c
uuid:aa72f23f-4c13-400a-b998-107151a3774c
issn:0011-4642

Subject:

matematika, mathematics, spectral graph theorye, igenvalue, connectivity, toughness, spanning k-tree, 13, and 51

Type:

model:article and TEXT

Format:

print, bez média, and svazek

Description:

The eigenvalues of graphs are related to many of its combinatorial properties. In his fundamental work, Fiedler showed the close connections between the Laplacian eigenvalues and eigenvectors of a graph and its vertex-connectivity and edge-connectivity. We present some new results describing the connections between the spectrum of a regular graph and other combinatorial parameters such as its generalized connectivity, toughness, and the existence of spanning trees with bounded degree., Sebastian M. Cioabă, Xiaofeng Gu., and Obsahuje seznam literatury

Language:

English

Rights:

http://creativecommons.org/publicdomain/mark/1.0/
policy:public

Coverage:

913-924

Source:

Czechoslovak Mathematical Journal | 2016 Volume:66 | Number:3

Harvested from:

CDK

Metadata only:

false