Hamiltonian decomposition of recursive circulant graphs
| Autor: | Daniel K. Biss |
|---|---|
| Rok vydání: | 2000 |
| Předmět: |
Vertex (graph theory)
Discrete mathematics 020203 distributed computing 0102 computer and information sciences 02 engineering and technology 01 natural sciences Graph Theoretical Computer Science Combinatorics Hamiltonian decomposition Circulant graph 010201 computation theory & mathematics 0202 electrical engineering electronic engineering information engineering Discrete Mathematics and Combinatorics Bound graph Regular graph Circulant matrix Mathematics |
| Zdroj: | Discrete Mathematics. 214:89-99 |
| ISSN: | 0012-365X |
| Popis: | The graph G(N,d) has vertex set V={0,1,…,N−1}, with {v,w} an edge if v−w≡±di(modN) for some 0⩽i⩽⌈logdN⌉−1. We show that the circulant graph G(cdm,d) is Hamilton decomposable for all positive integers c,d, and m with c |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|
Full Text from ScienceDirect