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

Autor:	Cioabă, Sebastian M.
Další autoři:	Gu, Xiaofeng
Jazyk:	angličtina
Předmět:	matematika mathematics články journal articles spectral graph theorye igenvalue connectivity toughness spanning k-tree
Druh dokumentu:	Non-fiction
ISSN:	0011-4642
Abstrakt:	Abstract: 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.
Databáze:	Katalog Knihovny AV ČR
Externí odkaz:	Online Access Full text from SpringerLink