{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,22]],"date-time":"2024-10-22T04:16:55Z","timestamp":1729570615597,"version":"3.28.0"},"reference-count":0,"publisher":"European Mathematical Society - EMS - Publishing House GmbH","issue":"2","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Port. Math."],"published-print":{"date-parts":[[2014,6,30]]},"abstract":"<jats:p>\n            In spectral graph theory a graph with least eigenvalue \n            <jats:inline-formula>\n              <jats:tex-math>-2<\/jats:tex-math>\n            <\/jats:inline-formula>\n             is exceptional if it is connected, has least eigenvalue greater than or equal to \n            <jats:inline-formula>\n              <jats:tex-math>-2<\/jats:tex-math>\n            <\/jats:inline-formula>\n            , and it is not a generalized line graph. A \n            <jats:inline-formula>\n              <jats:tex-math>(\\kappa,\\tau)<\/jats:tex-math>\n            <\/jats:inline-formula>\n            -regular set \n            <jats:inline-formula>\n              <jats:tex-math>S<\/jats:tex-math>\n            <\/jats:inline-formula>\n             of a graph is a vertex subset, inducing a \n            <jats:inline-formula>\n              <jats:tex-math>\\kappa<\/jats:tex-math>\n            <\/jats:inline-formula>\n            -regular subgraph such that every vertex not in \n            <jats:inline-formula>\n              <jats:tex-math>S<\/jats:tex-math>\n            <\/jats:inline-formula>\n             has \n            <jats:inline-formula>\n              <jats:tex-math>\\tau<\/jats:tex-math>\n            <\/jats:inline-formula>\n             neighbors in \n            <jats:inline-formula>\n              <jats:tex-math>S<\/jats:tex-math>\n            <\/jats:inline-formula>\n            . We present a recursive construction of all regular exceptional graphs as successive extensions by regular sets.\n          <\/jats:p>","DOI":"10.4171\/pm\/1942","type":"journal-article","created":{"date-parts":[[2014,7,1]],"date-time":"2014-07-01T14:31:51Z","timestamp":1404225111000},"page":"79-96","source":"Crossref","is-referenced-by-count":1,"title":["A recursive construction of the regular exceptional graphs with least eigenvalue \u20132"],"prefix":"10.4171","volume":"71","author":[{"given":"In\u00eas","family":"Barbedo","sequence":"first","affiliation":[{"name":"Politechnic Institute of Bragan\u00e7a, Mirandela, Portugal"}]},{"given":"Domingos M.","family":"Cardoso","sequence":"additional","affiliation":[{"name":"Universidade de Aveiro, Portugal"}]},{"given":"Drago\u0161","family":"Cvetkovi\u0107","sequence":"additional","affiliation":[{"name":"Serbian Academy of Sciences and Arts, Belgrade, Serbia"}]},{"given":"Paula","family":"Rama","sequence":"additional","affiliation":[{"name":"Universidade de Aveiro, Portugal"}]},{"given":"Slobodan K.","family":"Simi\u0107","sequence":"additional","affiliation":[{"name":"Serbian Academy of Sciences and Arts, Belgrade, Serbia"}]}],"member":"2673","container-title":["Portugaliae Mathematica"],"original-title":[],"link":[{"URL":"http:\/\/www.ems-ph.org\/fulltext\/10.4171\/PM\/1942","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,21]],"date-time":"2024-10-21T18:19:19Z","timestamp":1729534759000},"score":1,"resource":{"primary":{"URL":"https:\/\/ems.press\/doi\/10.4171\/pm\/1942"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,6,30]]},"references-count":0,"journal-issue":{"issue":"2"},"URL":"https:\/\/doi.org\/10.4171\/pm\/1942","relation":{},"ISSN":["0032-5155","1662-2758"],"issn-type":[{"type":"print","value":"0032-5155"},{"type":"electronic","value":"1662-2758"}],"subject":[],"published":{"date-parts":[[2014,6,30]]}}}