Generalised dual Seidel switching and Deza graphs with strongly regular children
نویسندگان
چکیده
A Deza graph G with parameters (n,k,b,a) is a k-regular n vertices such that any two distinct have b or common neighbours, where b⩾a. The children GA and GB of are defined on the vertex set every adjacent in if only they respectively. In this paper we present general approach to dual Seidel switching investigate graphs whose strongly regular graphs.
منابع مشابه
Deza Graphs: A Generalization of Strongly Regular Graphs
We consider the following generalization of strongly regular graphs. A graph G is a Deza graph if it is regular and the number of common neighbors of two distinct vertices takes on one of two values (not necessarily depending on the adjacency of the two vertices). We introduce several ways to construct Deza graphs, and develop some basic theory. We also list all diameter two Deza graphs which a...
متن کاملDistance-Regular Graphs with Strongly Regular Subconstituents
In [3] Cameron et al. classified strongly regular graphs with strongly regular subconstituents. Here we prove a theorem which implies that distance-regular graphs with strongly regular subconstituents are precisely the Taylor graphs and graphs with a1 = 0 and ai ∈ {0, 1} for i = 2, . . . , d .
متن کاملStrongly Regular Graphs with Parameters . . .
Using results on Hadamard difference sets, we construct regular graphical Hadamard matrices of negative type of order 4m for every positive integer m. If m > 1, such a Hadamard matrix is equivalent to a strongly regular graph with parameters (4m, 2m +m, m +m, m +m). Strongly regular graphs with these parameters have been called max energy graphs, because they have maximal energy (as defined by ...
متن کاملNew strongly regular graphs from switching of edges
By Seidel’s switching, we construct new strongly regular graphs with parameters (276, 140, 58, 84). In this paper, we simplify the known switching theorem due to Bose and Shrikhande as follows. Let G = (V,E) be a primitive strongly regular graph with parameters (v, k, λ, μ). Let S(G,H) be the graph from G by switching with respect to a nonempty H ⊂ V . Suppose v = 2(k − θ1) where θ1 is the nont...
متن کاملStrongly regular graphs
Strongly regular graphs form an important class of graphs which lie somewhere between the highly structured and the apparently random. This chapter gives an introduction to these graphs with pointers to more detailed surveys of particular topics.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2021
ISSN: ['1872-681X', '0012-365X']
DOI: https://doi.org/10.1016/j.disc.2020.112238