Hamiltonian decomposition of generalized recursive circulant graphs

DOI10.1016/j.ipl.2016.04.003zbMath1358.68221OpenAlexW2336259724MaRDI QIDQ284357

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

fault tolerancecirculant graphHamiltonian decompositiongeneralized recursive circulant graphrecursive circulant graph

Mathematics Subject Classification ID

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

Related Items (1)

The \(\lambda_3\)-connectivity and \(\kappa_3\)-connectivity of recursive circulants

Cites Work

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

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