Hamiltonian decomposition of generalized recursive circulant graphs

DOI10.1016/J.IPL.2016.04.003MaRDI QIDQ284357zbMATH OpenOpenAlexFDO

Authors Y-Chuang Chen, Tsung-Han Tsai

Publication date 18 May 2016

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ipl.2016.04.003

zbMATH Keywords

circulant graphfault tolerancegeneralized recursive circulant graphHamiltonian decompositionrecursive circulant graph

Mathematics Subject Classification ID

Eulerian and Hamiltonian graphs (05C45) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Reliability, testing and fault tolerance of networks and computer systems (68M15) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Hamiltonian decomposition of recursive circulant graphs
• The Hamiltonian property of generalized de Bruijn digraphs
• Disjoint Hamiltonian cycles in recursive circulant graphs
• scientific article; zbMATH DE number 1262801
• Pancyclicity of recursive circulant graphs

Cites work

• Disjoint Hamiltonian cycles in recursive circulant graphs
• Edge-pancyclicity of recursive circulants
• Fault-tolerant embedding of pairwise independent Hamiltonian paths on a faulty hypercube with edge faults
• Graph theory with applications
• Hamiltonian decomposition of recursive circulant graphs
• Hamiltonian decompositions of complete \(k\)-uniform hypergraphs
• The super-connected property of recursive circulant graphs

Cited in

(6)

• Hamiltonian circuits in interval graph generalizations
• Hamiltonian decomposition of recursive circulant graphs
• The \(\lambda_3\)-connectivity and \(\kappa_3\)-connectivity of recursive circulants
• Disjoint Hamiltonian cycles in recursive circulant graphs
• scientific article; zbMATH DE number 1262801 (Why is no real title available?)
• scientific article; zbMATH DE number 1990709 (Why is no real title available?)

This page was built for publication: Hamiltonian decomposition of generalized recursive circulant graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q284357)