A recursive construction of the regular exceptional graphs with least eigenvalue –2

Detalhes bibliográficos
Autor(a) principal: Barbedo, Inês
Data de Publicação: 2014
Outros Autores: Cardoso, Domingos M., Cvetković, Dragoš, Rama, Paula, Simić, Slobodan
Tipo de documento: Artigo
Idioma: eng
Título da fonte: Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos)
Texto Completo: http://hdl.handle.net/10198/17065
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.
id RCAP_dc1d4edb8c21f3bf5db0f48d6c3ad2be
oai_identifier_str oai:bibliotecadigital.ipb.pt:10198/17065
network_acronym_str RCAP
network_name_str Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos)
repository_id_str 7160
spelling A recursive construction of the regular exceptional graphs with least eigenvalue –2Spectral graph theoryExceptional graphsPosetsIn 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.The authors I. Barbedo, D. M. Cardoso and P. Rama were partially supported by Portuguese funds through the CIDMA - Center for Research and Development in Mathematics and Applications, and the Portuguese Foundation for Science and Technology (“FCT-Funda¸c˜ao para a Ciˆencia e a Tecnologia”), within project PEst-OE/MAT/UI4106/2014.Biblioteca Digital do IPBBarbedo, InêsCardoso, Domingos M.Cvetković, DragošRama, PaulaSimić, Slobodan2018-04-16T13:57:57Z20142014-01-01T00:00:00Zinfo:eu-repo/semantics/publishedVersioninfo:eu-repo/semantics/articleapplication/pdfhttp://hdl.handle.net/10198/17065engBarbedo, 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‎0032-515510.4171/PM/19421662-2758info:eu-repo/semantics/openAccessreponame:Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos)instname:Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informaçãoinstacron:RCAAP2023-11-21T10:39:07Zoai:bibliotecadigital.ipb.pt:10198/17065Portal AgregadorONGhttps://www.rcaap.pt/oai/openaireopendoar:71602024-03-19T23:06:33.580363Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) - Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informaçãofalse
dc.title.none.fl_str_mv A recursive construction of the regular exceptional graphs with least eigenvalue –2
title A recursive construction of the regular exceptional graphs with least eigenvalue –2
spellingShingle A recursive construction of the regular exceptional graphs with least eigenvalue –2
Barbedo, Inês
Spectral graph theory
Exceptional graphs
Posets
title_short A recursive construction of the regular exceptional graphs with least eigenvalue –2
title_full A recursive construction of the regular exceptional graphs with least eigenvalue –2
title_fullStr A recursive construction of the regular exceptional graphs with least eigenvalue –2
title_full_unstemmed A recursive construction of the regular exceptional graphs with least eigenvalue –2
title_sort A recursive construction of the regular exceptional graphs with least eigenvalue –2
author Barbedo, Inês
author_facet Barbedo, Inês
Cardoso, Domingos M.
Cvetković, Dragoš
Rama, Paula
Simić, Slobodan
author_role author
author2 Cardoso, Domingos M.
Cvetković, Dragoš
Rama, Paula
Simić, Slobodan
author2_role author
author
author
author
dc.contributor.none.fl_str_mv Biblioteca Digital do IPB
dc.contributor.author.fl_str_mv Barbedo, Inês
Cardoso, Domingos M.
Cvetković, Dragoš
Rama, Paula
Simić, Slobodan
dc.subject.por.fl_str_mv Spectral graph theory
Exceptional graphs
Posets
topic Spectral graph theory
Exceptional graphs
Posets
description 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.
publishDate 2014
dc.date.none.fl_str_mv 2014
2014-01-01T00:00:00Z
2018-04-16T13:57:57Z
dc.type.status.fl_str_mv info:eu-repo/semantics/publishedVersion
dc.type.driver.fl_str_mv info:eu-repo/semantics/article
format article
status_str publishedVersion
dc.identifier.uri.fl_str_mv http://hdl.handle.net/10198/17065
url http://hdl.handle.net/10198/17065
dc.language.iso.fl_str_mv eng
language eng
dc.relation.none.fl_str_mv 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
‎0032-5155
10.4171/PM/1942
1662-2758
dc.rights.driver.fl_str_mv info:eu-repo/semantics/openAccess
eu_rights_str_mv openAccess
dc.format.none.fl_str_mv application/pdf
dc.source.none.fl_str_mv reponame:Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos)
instname:Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informação
instacron:RCAAP
instname_str Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informação
instacron_str RCAAP
institution RCAAP
reponame_str Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos)
collection Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos)
repository.name.fl_str_mv Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) - Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informação
repository.mail.fl_str_mv
_version_ 1799135319507861504

Registros relacionados