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

Inês Barbedo | Zendy; Domingos M. Cardoso | Zendy; Dragoš Cvetković | Zendy; Paula Rama | Zendy; Slobodan K. Simić | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

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

Author(s) -

Inês Barbedo,

Domingos M. Cardoso,

Dragoš Cvetković,

Paula Rama,

Slobodan K. Simić

Publication year - 2014

Publication title -

portugaliae mathematica

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.228

H-Index - 14

eISSN - 1662-2758

pISSN - 0032-5155

DOI - 10.4171/pm/1942

Subject(s) - mathematics , eigenvalues and eigenvectors , combinatorics , discrete mathematics , algebra over a field , pure mathematics , quantum mechanics , physics

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 generalizedline 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

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research