Abstract
Given a finite group and a subset the bi-Cayley graph $\bcay(G,S)$ is the graph whose vertex set is and edge set is . A bi-Cayley graph $\bcay(G,S)$ is called a BCI-graph if for any bi-Cayley graph $\bcay(G,T),$ $\bcay(G,S) \cong \bcay(G,T)$ implies that for some and $α\in \aut(G)$. A group is called an -BCI-group if all bi-Cayley graphs of of valency at most are BCI-graphs.In this paper we prove that, a finite nilpotent group is a 3-BCI-group if and only if it is in the form where is a homocyclic group of odd order, and is trivial or one of the groups and $\Q_8$.
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.