Spectra of strongly Deza graphs
| Autor: | Elena V. Konstantinova, Mohammad Ali Hosseinzadeh, Vladislav V. Kabanov, Willem H. Haemers, Leonid Shalaginov, Saieed Akbari |
|---|---|
| Přispěvatelé: | Econometrics and Operations Research |
| Rok vydání: | 2021 |
| Předmět: |
Discrete mathematics
Strongly regular graph Divisible design graph Eigenvalues Distance-regular graph Graph Spectral line Cospectral graphs Theoretical Computer Science Vertex (geometry) Combinatorics FOS: Mathematics Discrete Mathematics and Combinatorics Mathematics - Combinatorics Deza graph Combinatorics (math.CO) Eigenvalues and eigenvectors Mathematics |
| Zdroj: | Discrete Mathematics, 344(12):112622. Elsevier |
| ISSN: | 0012-365X |
| DOI: | 10.48550/arxiv.2101.06877 |
| Popis: | A Deza graph G with parameters ( n , k , b , a ) is a k-regular graph with n vertices such that any two distinct vertices have b or a common neighbours. The children G A and G B of a Deza graph G are defined on the vertex set of G such that every two distinct vertices are adjacent in G A or G B if and only if they have a or b common neighbours, respectively. A strongly Deza graph is a Deza graph with strongly regular children. In this paper we give a spectral characterisation of strongly Deza graphs, show relationships between eigenvalues, and study strongly Deza graphs which are distance-regular. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|
Full Text from ScienceDirect