Characterization of \(c\)-circulant digraphs of degree two which are circulant
type: Item
instance of: scholarly article
title: Characterization of \(c\)-circulant digraphs of degree two which are circulant
zbMATH Open document ID: 0878.05040
DOI: 10.1016/S0012-365X(96)00165-3
published in: Discrete Mathematics
publication date: 1998-01-05T00:00:00Z
review text: A digraph \(G_N(c,\Delta)\) with a positive integer \(N\), a subset \(\Delta\) of \(\mathbb{Z}_N\) and \(0\neq c\in\mathbb{Z}_N\) is called \(c\)-circulant digraph if \(\mathbb{Z}_N\) is the set of vertices and the adjacency rules are given by functions \(x\to cx+a\) with \(a\in\Delta\). The authors give necessary and sufficient conditions for a \(c\)-circular digraph of degree two, \(G_N(c,\{a_1,a_2\})\), to be isomorphic to some circulant digraph \(G_N(1,\{b_1,b_2\})\). Further, they give sufficient conditions for \(G_N(c,\Delta)\) to be a Cayley digraph.
Mathematics Subject Classification ID: 05C20
Mathematics Subject Classification ID: 05C75
Mathematics Subject Classification ID: 05C25
zbMATH DE Number: 1019089
zbMATH Keywords: circulant digraph
zbMATH Keywords: Cayley digraph
author: Josep M. Brunat
author: Montserrat Maureso
author: Mercè Mora
reviewed by: Michael Hager
MaRDI profile type: Publication
cites work: Roots and Canonical Forms for Circulant Matrices
cites work: A group-theoretic model for symmetric interconnection networks
cites work: On Cayley line digraphs
cites work: New methods for using Cayley graphs in interconnection networks
cites work: Q3208805
cites work: Generalized de Bruijn digraphs
cites work: Symmetry in interconnection networks based on Cayley graphs of permutation groups: A survey
cites work: Q3792704
cites work: On a Class of Fixed-Point-Free Graphs
cites work: Q4505229
description: scientific article; zbMATH DE number 1019089