Utilize este identificador para referenciar este registo: http://hdl.handle.net/10198/17065
Título: A recursive construction of the regular exceptional graphs with least eigenvalue –2
Autor: Barbedo, Inês
Cardoso, Domingos M.
Cvetković, Dragoš
Rama, Paula
Simić, Slobodan
Palavras-chave: Spectral graph theory
Exceptional graphs
Posets
Data: 2014
Citação: Barbedo, Inês; Cardoso, Domingos; Cvetković, Dragoš; Rama, Paula; Simić, Slobodan (2014) - A recursive construction of the regular exceptional graphs with least eigenvalue –2. Portugaliae Mathematica. ISSN 0032-5155. 71:2, p. 79-96
Resumo: 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 (κ,τ)-regular set S of a graph is a vertex subset, inducing a κ-regular subgraph such that every vertex not in S has τ 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/10198/17065
DOI: 10.4171/PM/1942
ISSN: ‎0032-5155
1662-2758
Aparece nas colecções:EsACT - Artigos em Revistas Indexados à WoS/Scopus

Ficheiros deste registo:
Ficheiro Descrição TamanhoFormato 
Exceptional_graphs_revised.pdf176,06 kBAdobe PDFVer/Abrir


FacebookTwitterDeliciousLinkedInDiggGoogle BookmarksMySpace
Formato BibTex MendeleyEndnote Degois 

Todos os registos no repositório estão protegidos por leis de copyright, com todos os direitos reservados.