Endo-circulant digraphs: Connectivity and generalized cycles (Q1292822)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Endo-circulant digraphs: Connectivity and generalized cycles |
scientific article; zbMATH DE number 1322008
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Endo-circulant digraphs: Connectivity and generalized cycles |
scientific article; zbMATH DE number 1322008 |
Statements
Endo-circulant digraphs: Connectivity and generalized cycles (English)
0 references
10 April 2000
0 references
Let \(A\) be a finite abelian group and \(\Delta\subset A\). For any endomorphism \(\phi\) of \(A\), the endo-circulant digraph \(G_A(\phi,\Delta)\) is defined to have vertex set \(A\) and edge set \(\{x\to \phi(x)+ a\mid a\in\Delta\}\). When is an endo-circulant digraph connected? In this paper, a necessary and sufficient conditon is given.
0 references
cycles
0 references
connectivity
0 references
endo-circulant digraph
0 references
0 references
0.8934193
0 references
0.8837444
0 references
0 references
0.88296956
0 references
0 references
0.88106394
0 references