On the BCI problem
Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Finite automorphism groups of algebraic, geometric, or combinatorial structures (20B25) Abelian groups (20K99)
The authors' main aim is to investigate the relationship between the symmetries of the Cayley digraph of a group \(G\) and other graphs and digraphs arising from different actions of \(G\), as well as similar relationships for problems that depend on symmetries. It is well known that the isomorphism problem for Cayley digraphs depends on a property of its automorphism group. The bi-Cayley isomorphism problem (BCI problem) asks whether two Haar graphs of a group \(G\) are isomorphic by a specific list \(\mathcal L\) of maps. The authors show that the Cayley isomorphism problem can be generalized in at least two ways, and that the list of maps of the current BCI problem is not a shortest list of natural maps to check for isomorphism, but is shorter than in the sense that the shortest list of elements that normalize the natural semiregular subgroup isomorphic to a group \(G\) that is contained in the automorphism group of a Haar graph of \(G\). They also develop similar results to reduce the isomorphism problem of Haar graphs of \(G\) to conjugacy classes of semi-regular subgroups of \(G\) in their automorphism groups. Then they consider the isomorphism problem for the first three families, reducing it to the isomorphism problem for related quotients, subgraphs, or Cayley digraphs. They establish that the isomorphism problem for Haar graphs of abelian groups of odd order whose connection set is self-inverse does not reduce the ABCI problem to the CI problem. They remark that there are two obstacles to this, with the obstacles coming from graphs that have twins or are disconnected.
- A characterization of particular symmetric (0,1) matrices
- A classification of nilpotent 3-BCI groups
- A classification of semisymmetric graphs of order 2pq
- A complete classification of finite homogeneous groups
- A solution of the isomorphism problem for circulant graphs
- An elementary Abelian group of rank 4 is a CI-group
- Automorphism Groups of Metacirculant Graphs of Order a Product of Two Distinct Primes
- Automorphism groups of wreath product digraphs
- Automorphisms of the double cover of a circulant graph of valency at most 7
- BCI-property of bi-Cayley graph
- Canonical double covers of circulants
- CI-property of \(C_p^2 \times C_n\) and \(C_p^2 \times C_q^2\) for digraphs
- Classification of vertex-transitive graphs of order a prime cubed. I
- Cyclic Haar graphs
- Elementary abelian groups of rank 5 are DCI-groups
- Elementary proof that \(\mathbb{Z}_p^4\) is a DCI-group
- scientific article; zbMATH DE number 3821776 (Why is no real title available?)
- scientific article; zbMATH DE number 894528 (Why is no real title available?)
- Isomorphic tetravalent cyclic Haar graphs
- Isomorphism problem for a class of point-symmetric structures
- Isomorphism problem for Cayley graphs of \(\mathbb{Z}^ 3_ p\)
- On a Class of Fixed-Point-Free Graphs
- On automorphism groups of circulant digraphs of square-free order
- On automorphisms of direct products of Cayley graphs on abelian groups
- On automorphisms of Haar graphs of abelian groups
- On automorphisms of the double cover of a circulant graph
- On the Cayley isomorphism problem
- On the Cayley isomorphism problem for Cayley objects of nilpotent groups of some orders
- On the isomorphism problem for Cayley graphs of abelian groups whose Sylow subgroups are elementary abelian or cyclic
- On the isomorphism problem for cyclic combinatorial objects
- Quotients of CI-groups are CI-groups
- Rose window graphs
- Semisymmetric cubic graphs constructed from bi-Cayley graphs of A_n.
- Some conditions implying stability of graphs
- Stability of circulant graphs
- Symmetry in Graphs
- The automorphisms of bi-Cayley graphs
- The Cayley isomorphism property for \(\mathbb{Z}_p^3\times\mathbb{Z}_q\)
- The Cayley isomorphism property for Cayley maps
- The composition of graphs
- The Group is a CI-Group
- The rank and size of graphs
- Vertex-transitive graphs
- Vertex-transitive Haar graphs that are not Cayley graphs
This page was built for publication: On the BCI problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7295083)
