The exponent of the primitive Cayley digraphs on finite abelian groups
From MaRDI portal
(Redirected from Publication:1382274)
Let \(S\) be the set of the central elements of a finite group \(G\). The authors find necessary and sufficient conditions for a Cayley digraph to be primitive. They also show that the exponent of a primitive Cayley digraph on an abelian group is \(n-1\), \([n/2]\), \([n/2] -1\), or does not exceed \([n/3] +1\). A characterization of digraphs corresponding to the first three exponents is given.
Recommendations
Cites work
- An application of connectivity theory in graphs to factorizations of elements in groups
- Circulant Boolean relation matrices
- Combinatorial matrix theory
- Double loop networks with minimum delay
- Endliche Gruppen I
- Graph theory
- scientific article; zbMATH DE number 3492862 (Why is no real title available?)
- On a combinatorial theorem and its application to nonnegative matrices
- On circulant Boolean matrices
- On Powers of Non-Negative Matrices
- The index set problem for Boolean (or nonnegative) matrices
- The minimum order of a cayley graph with given degree and diameter
- Unzerlegbare, nicht negative Matrizen
This page was built for publication: The exponent of the primitive Cayley digraphs on finite abelian groups
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1382274)