TOPICS
Search

Bi-Cayley Graph


A bi-Cayley graph over a group H is a graph admitting a semiregular group action of H by graph automorphisms with exactly two group orbits on its vertex set. Equivalently, for suitable subsets R,L,S subset= H, a bi-Cayley graph is a graph BiCay(H,R,L,S) that has vertices

 H_0 union H_1={h_0:h in H} union {h_1:h in H},

with right edges h_0g_0 whenever gh^(-1) in R, left edges h_1g_1 whenever gh^(-1) in L, and spoke edges h_0g_1 whenever gh^(-1) in S. For a simple graph, the subsets R and L are inverse-closed (closed under taking inverse elements) and do not contain the identity element. The term semi-Cayley graph is sometimes used for the same notion.

When H is a cyclic group, bi-Cayley graphs are bicirculant graphs. In particular, the bi-Cayley graphs over cyclic groups with both orbits independent are the Haar graphs.


See also

Bicirculant Graph, Cayley Graph, Cyclic Group, Group Orbit, Haar Graph, Semiregular Group Action

Explore with Wolfram|Alpha

References

Feng, Y.-Q. and Zhou, J.-X. "Cubic Bi-Cayley Graphs over Abelian Groups." Europ. J. Combin. 36, 679-693, 2014.

Cite this as:

Weisstein, Eric W. "Bi-Cayley Graph." From MathWorld--A Wolfram Resource. https://mathworld.wolfram.com/Bi-CayleyGraph.html

Subject classifications