On Bipartite Distance-Regular Cayley Graphs with Small Diameter

نویسندگان

چکیده

We study bipartite distance-regular Cayley graphs with diameter three or four. give sufficient conditions under which a graph can be constructed on the semidirect product of group — part this contains identity element and $\mathbb{Z}_{2}$. apply to case three, consider cases where are not satisfied for some specific groups such as dihedral group.We also extend result by Miklavič Potočnik that relates difference sets This new involves certain partial geometric in antipodal relative sets.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Tight Distance-regular Graphs with Small Diameter

We prove the following bound for a k regular graph on n vertices with nontrivial eigenvalues from the interval r s n k rs k r k s Equality holds if and only if the graph is strongly regular with eigenvalues in fk s rg Nonbipartite distance regular graphs with diameter d and eigenvalues k d whose local graphs satisfy the above bound with equality for s b and r b d are called tight graphs and are...

متن کامل

Bipartite regular graphs with fixed diameter

For given nonnegative integers k and D , we consider the problem of determining n,(k, D ) , the smallest number n for which there exists a k-regular bipartite graph on n vertices with diameter D . We solve the problem for all pairs ( k , D ) with D + 2 (mod 4) and D + 3 (mod 4), for all pairs ( k , D ) with k even or k prime and D + 3 (mod 4), for all pairs with D I 9 or k I 4, and for a few ot...

متن کامل

Distance-regular Cayley graphs on dihedral groups

The main result of this article is a classification of distance-regular Cayley graphs on dihedral groups. There exist four obvious families of such graphs, which are called trivial. These are: complete graphs, complete bipartite graphs, complete bipartite graphs with the edges of a 1-factor removed, and cycles. It is proved that every nontrivial distance-regular Cayley graph on a dihedral group...

متن کامل

Cubic Cayley graphs with small diameter

In this paper we apply Pólya’s Theorem to the problem of enumerating Cayley graphs on permutation groups up to isomorphisms induced by conjugacy in the symmetric group. We report the results of a search of all three-regular Cayley graphs on permutation groups of degree at most nine for small diameter graphs. We explore several methods of constructing covering graphs of these Cayley graphs. Exam...

متن کامل

On bipartite Q-polynomial distance-regular graphs

Let Γ denote a bipartite Q-polynomial distance-regular graph with vertex set X, diameter d ≥ 3 and valency k ≥ 3. Let RX denote the vector space over R consisting of column vectors with entries in R and rows indexed by X. For z ∈ X, let ẑ denote the vector in RX with a 1 in the z-coordinate, and 0 in all other coordinates. Fix x, y ∈ X such that ∂(x, y) = 2, where ∂ denotes path-length distance...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Electronic Journal of Combinatorics

سال: 2022

ISSN: ['1077-8926', '1097-1440']

DOI: https://doi.org/10.37236/10757