Loading...
Loading...

Go to the content (press return)

Eigenvalue interlacing and weight parameters of graphs

Author
Fiol, M.
Type of activity
Journal article
Journal
Linear algebra and its applications
Date of publication
1999-03
Volume
290
First page
275
Last page
301
Repository
http://hdl.handle.net/2117/14729 Open in new window
URL
http://www.sciencedirect.com/science?_ob=ArticleURL&_udi=B6V0R-3WKXS2G-M&_user=1517299&_coverDate=03%2F15%2F1999&_rdoc=1&_fmt=high&_orig=gateway&_origin=gateway&_sort=d&_docanchor=&view=c&_acct=C000053450&_version=1&_urlVersion=0&_userid=1517299&md5=bde58bab55b6d6cacba67e1f178c13b1&searchtype=a Open in new window
Abstract
Eigenvalue interlacing is a versatile technique for deriving results in algebraic combinatorics. In particular, it has been successfully used for proving a number of results about the relation between the (adjacency matrix or Laplacian) spectrum of a graph and some of its properties. For instance, some characterizations of regular partitions, and bounds for some parameters, such as the independence and chromatic numbers, the diameter, the bandwidth, etc., have been obtained. For each parameter o...
Citation
Fiol, M. A. Eigenvalue interlacing and weight parameters of graphs. "Linear algebra and its applications", Març 1999, vol. 290, p. 275-301.
Group of research
COMBGRAPH - Combinatorics, Graph Theory and Applications

Participants

Attachments