A classification of nilpotent 3-BCI groups
Group Theory
2013-09-02 v1 Combinatorics
Abstract
Given a finite group and a subset the bi-Cayley graph is the graph whose vertex set is and edge set is . A bi-Cayley graph is called a BCI-graph if for any bi-Cayley graph implies that for some and . 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 .
Cite
@article{arxiv.1308.6812,
title = {A classification of nilpotent 3-BCI groups},
author = {Hiroki Koike and István Kovács},
journal= {arXiv preprint arXiv:1308.6812},
year = {2013}
}