Please use this identifier to cite or link to this item:
http://hdl.handle.net/10773/13473
Title: | A recursive construction of the regular exceptional graphs with least eigenvalue -2 |
Author: | Barbedo, I. Cardoso, Domingos M. Cvetkovic, D. Rama, P. Simic, S. K. |
Keywords: | Spectral graph theory Exceptional graphs Posets |
Issue Date: | 2014 |
Publisher: | European Mathematical Society Publishing House |
Abstract: | In spectral graph theory a graph with least eigenvalue 2 is exceptional if it is connected, has least eigenvalue greater than or equal to 2, and it is not a generalized line graph. A ðk; tÞ-regular set S of a graph is a vertex subset, inducing a k-regular subgraph such that every vertex not in S has t neighbors in S. We present a recursive construction of all regular exceptional graphs as successive extensions by regular sets. |
Peer review: | yes |
URI: | http://hdl.handle.net/10773/13473 |
DOI: | 10.4171/PM/1942 |
ISSN: | 0032-5155 |
Appears in Collections: | CIDMA - Artigos OGTCG - Artigos |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
Barbedo_et_al.pdf | Research article | 281.37 kB | Adobe PDF |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.