Javascript must be enabled to continue!
On Bipartite Distance-Regular Cayley Graphs with Small Diameter
View through CrossRef
We study bipartite distance-regular Cayley graphs with diameter three or four. We give sufficient conditions under which a bipartite Cayley graph can be constructed on the semidirect product of a group — the part of this bipartite Cayley graph which contains the identity element — and $\mathbb{Z}_{2}$. We apply this to the case of bipartite distance-regular Cayley graphs with diameter three, and consider cases where the sufficient conditions are not satisfied for some specific groups such as the dihedral group.We also extend a result by Miklavič and Potočnik that relates difference sets to bipartite distance-regular Cayley graphs with diameter three to the case of diameter four. This new case involves certain partial geometric difference sets and — in the antipodal case — relative difference sets.
The Electronic Journal of Combinatorics
Title: On Bipartite Distance-Regular Cayley Graphs with Small Diameter
Description:
We study bipartite distance-regular Cayley graphs with diameter three or four.
We give sufficient conditions under which a bipartite Cayley graph can be constructed on the semidirect product of a group — the part of this bipartite Cayley graph which contains the identity element — and $\mathbb{Z}_{2}$.
We apply this to the case of bipartite distance-regular Cayley graphs with diameter three, and consider cases where the sufficient conditions are not satisfied for some specific groups such as the dihedral group.
We also extend a result by Miklavič and Potočnik that relates difference sets to bipartite distance-regular Cayley graphs with diameter three to the case of diameter four.
This new case involves certain partial geometric difference sets and — in the antipodal case — relative difference sets.
Related Results
On isomorphisms of m-Cayley digraphs
On isomorphisms of m-Cayley digraphs
The isomorphism problem for digraphs is a fundamental problem in graph theory. This problem for Cayley digraphs has been extensively investigated over the last half a century. In t...
Finite edge-transitive Cayley graphs and rotary Cayley maps
Finite edge-transitive Cayley graphs and rotary Cayley maps
This paper aims to develop a theory for studying Cayley graphs, especially for those with a high degree of symmetry. The theory consists of analysing several types of basic Cayley ...
The Cayley Isomorphism Property for Cayley Maps
The Cayley Isomorphism Property for Cayley Maps
The Cayley Isomorphism property for combinatorial objects was introduced by L. Babai in 1977. Since then it has been intensively studied for binary relational structures: graphs, d...
Power Cayley Graphs of Dihedral Groups with Certain Order
Power Cayley Graphs of Dihedral Groups with Certain Order
Combination of the concepts of power graph and Cayley graph associated to groups has led to the introduction to two new variations of Cayley graph known as the union power Cayley g...
Complete (2,2) Bipartite Graphs
Complete (2,2) Bipartite Graphs
A bipartite graph G can be treated as a (1,1) bipartite graph in the sense that, no two vertices in the same part are at distance one from each other. A (2,2) bipartite graph is an...
Roughness in Fuzzy Cayley Graphs
Roughness in Fuzzy Cayley Graphs
Rough set theory is a worth noticing approach for inexact and uncertain system modelling. When rough set theory accompanies with fuzzy set theory, which both are a complementary ge...
Independent Set in Neutrosophic Graphs
Independent Set in Neutrosophic Graphs
New setting is introduced to study neutrosophic independent number and independent neutrosophic-number arising neighborhood of different vertices. Neighbor is a key term to have th...
Failed Independent Number in Neutrosophic Graphs
Failed Independent Number in Neutrosophic Graphs
New setting is introduced to study neutrosophic failed-independent number and failed independent neutrosophic-number arising neighborhood of different vertices. Neighbor is a key t...

