The exponent of the primitive Cayley digraphs on finite abelian groups
type: Item
instance of: scholarly article
title: The exponent of the primitive Cayley digraphs on finite abelian groups
zbMATH Open document ID: 0897.05045
DOI: 10.1016/S0166-218X(97)00055-3
published in: Discrete Applied Mathematics
publication date: 1998-06-02T00:00:00Z
full work available at URL: dam
review text: 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.
Mathematics Subject Classification ID: 05C25
Mathematics Subject Classification ID: 05C20
Mathematics Subject Classification ID: 05C50
Mathematics Subject Classification ID: 05C38
Mathematics Subject Classification ID: 05C75
zbMATH DE Number: 1133169
zbMATH Keywords: exponent
zbMATH Keywords: primitive Cayley digraph
zbMATH Keywords: characterization
author: Jianzhong Wang
author: Jixiang Meng
reviewed by: Steven C. Althoen
MaRDI profile type: Publication
cites work: Q5422499
cites work: Combinatorial matrix theory
cites work: Circulant Boolean relation matrices
cites work: An application of connectivity theory in graphs to factorizations of elements in groups
cites work: The minimum order of a cayley graph with given degree and diameter
cites work: On Powers of Non-Negative Matrices
cites work: On circulant Boolean matrices
cites work: Endliche Gruppen I
cites work: Double loop networks with minimum delay
cites work: The index set problem for Boolean (or nonnegative) matrices
cites work: On a combinatorial theorem and its application to nonnegative matrices
cites work: Q4075031
cites work: Unzerlegbare, nicht negative Matrizen
description: scientific article; zbMATH DE number 1133169