Constructions for cyclic Moebius ladder systems

DOI10.1016/j.disc.2009.03.050zbMath1222.05232OpenAlexW2042531871MaRDI QIDQ712219

Anita Pasotti

Publication date: 28 October 2010

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2009.03.050

zbMATH Keywords

graceful labeling(cyclic) graph decomposition\(\alpha \)-labelingMoebius ladder

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Related Items (5)

Decompositions of complete graphs into circulants ⋮ On \(\sigma \)-tripartite labelings of odd prisms and even Möbius ladders ⋮ Balanced equi-\(n\)-squares ⋮ On cyclic \(G\)-designs where \(G\) is a cubic tripartite graph ⋮ Critical parameters of the synchronisation's stability for coupled maps in regular graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Further progress on difference families with block size 4 or 5
• Combinatorial designs and the theorem of Weil on multiplicative character sums
• On the existence of elementary Abelian cycle systems
• Strongly graceful graphs
• Cyclic designs with block size 4 and related optimal optical orthogonal codes
• Some progress on \((v,4,1)\) difference families and optical orthogonal codes
• Some constructions for cyclic perfect cycle systems
• Strong difference families over arbitrary graphs
• On perfect Γ-decompositions of the complete graph
• On the Möbius Ladders

This page was built for publication: Constructions for cyclic Moebius ladder systems