On Hamiltonicity of circulant digraphs of outdegree three
Abstract
This paper deals with Hamiltonicity of connected loopless circulant digraphs of outdegree three with connection set of the form ▫$\{a,ka,c\}$▫, where ▫$k$▫ is an integer. In particular, we prove that if ▫$k=-1$▫ or ▫$k=2$▫ such a circulant digraph is Hamiltonian if and only if it is not isomorphic to the circulant digraph on 12 vertices with connection set ▫$\{3,6,4\}$▫.
Keywords
teorija grafov;Hamiltonov cikel;graph theory;circulant digraph;Hamilton cycle;
Data
| Language: | English |
|---|---|
| Year of publishing: | 2009 |
| Typology: | 1.01 - Original Scientific Article |
| Organization: | UL FMF - Faculty of Mathematics and Physics |
| UDC: | 519.17 |
| COBISS: |
1024054100
|
| ISSN: | 0012-365X |
| Views: | 2834 |
| Downloads: | 100 |
| Average score: | 0 (0 votes) |
| Metadata: |
|
Other data
| Secondary language: | English |
|---|---|
| Secondary keywords: | teorija grafov;Hamiltonov cikel; |
| Type (COBISS): | Not categorized |
| Pages: | str. 5437-5443 |
| Volume: | ǂVol. ǂ309 |
| Issue: | ǂiss. ǂ17 |
| Chronology: | 2009 |
| DOI: | 10.1016/j.disc.2008.12.004 |
| ID: | 1477155 |
Recommended works:
On Hamiltonicity of circulant digraphs of outdegree three
2009,
no subtitle data available
Fulereni
2011,
delo diplomskega seminarja
Hamiltonicity of vertex-transitive graphs of order 4p
2008,
no subtitle data available
Hamiltonske prizme
2012,
diplomsko delo
Recent trends and future directions in vertex-transitive graphs
2008,
no subtitle data available