Publication
A recursive construction of the regular exceptional graphs with least eigenvalue –2
| dc.contributor.author | Barbedo, Inês | |
| dc.contributor.author | Cardoso, Domingos M. | |
| dc.contributor.author | Cvetković, Dragoš | |
| dc.contributor.author | Rama, Paula | |
| dc.contributor.author | Simić, Slobodan | |
| dc.date.accessioned | 2018-04-16T13:57:57Z | |
| dc.date.available | 2018-04-16T13:57:57Z | |
| dc.date.issued | 2014 | |
| dc.description.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 (κ,τ)-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. | pt_PT |
| dc.description.sponsorship | 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. | |
| dc.description.version | info:eu-repo/semantics/publishedVersion | pt_PT |
| dc.identifier.citation | 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 | pt_PT |
| dc.identifier.doi | 10.4171/PM/1942 | pt_PT |
| dc.identifier.eissn | 1662-2758 | |
| dc.identifier.issn | 0032-5155 | |
| dc.identifier.uri | http://hdl.handle.net/10198/17065 | |
| dc.language.iso | eng | pt_PT |
| dc.peerreviewed | yes | pt_PT |
| dc.rights.uri | http://creativecommons.org/licenses/by/4.0/ | pt_PT |
| dc.subject | Spectral graph theory | pt_PT |
| dc.subject | Exceptional graphs | pt_PT |
| dc.subject | Posets | pt_PT |
| dc.title | A recursive construction of the regular exceptional graphs with least eigenvalue –2 | pt_PT |
| dc.type | journal article | |
| dspace.entity.type | Publication | |
| oaire.awardURI | info:eu-repo/grantAgreement/FCT/5876/PEst-OE%2FMAT%2FUI4106%2F2014/PT | |
| oaire.citation.endPage | 96 | pt_PT |
| oaire.citation.issue | 2 | pt_PT |
| oaire.citation.startPage | 79 | pt_PT |
| oaire.citation.title | PORTUGALIAE MATHEMATICA | pt_PT |
| oaire.citation.volume | 71 | pt_PT |
| oaire.fundingStream | 5876 | |
| person.familyName | Barbedo | |
| person.givenName | Inês | |
| person.identifier.ciencia-id | 681B-7253-50B1 | |
| person.identifier.orcid | 0000-0001-6350-9697 | |
| project.funder.identifier | http://doi.org/10.13039/501100001871 | |
| project.funder.name | Fundação para a Ciência e a Tecnologia | |
| rcaap.rights | openAccess | pt_PT |
| rcaap.type | article | pt_PT |
| relation.isAuthorOfPublication | 8a4e21c4-845a-4fb3-a772-bab297bae908 | |
| relation.isAuthorOfPublication.latestForDiscovery | 8a4e21c4-845a-4fb3-a772-bab297bae908 | |
| relation.isProjectOfPublication | 541dab74-3545-46df-ae09-5e92ff0337fc | |
| relation.isProjectOfPublication.latestForDiscovery | 541dab74-3545-46df-ae09-5e92ff0337fc |