Spectra of strongly Deza graphs

DISCRETE MATHEMATICS(2021)

引用 1|浏览35
暂无评分
摘要
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. (C) 2021 Elsevier B.V. All rights reserved.
更多
查看译文
关键词
Deza graph, Eigenvalues, Strongly regular graph, Divisible design graph, Distance-regular graph, Cospectral graphs
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要