Strong difference families over arbitrary graphs

DOI10.1002/jcd.20201zbMath1182.05016OpenAlexW1979176759MaRDI QIDQ3614742

Lucia Gionfriddo, Marco Buratti

Publication date: 9 March 2009

Published in: Journal of Combinatorial Designs (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jcd.20201

zbMATH Keywords

graceful labelingrelative difference family\(\alpha\)-labelingstrong difference familyregular graph decomposition

Mathematics Subject Classification ID

Combinatorial aspects of difference sets (number-theoretic, group-theoretic, etc.) (05B10) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Related Items

Decompositions of complete graphs into circulants, Cyclic balanced sampling plans excluding contiguous units with block size four, Some infinite classes of optimal \({(v,\{3,4\},1,Q)}\)-OOCs with \({Q\in\{(\frac{1}{3},\frac{2}{3}),(\frac{2}{3},\frac{1}{3})\}}\), Constructions of optimal variable-weight OOCs via quadratic residues, Decomposing the complete graph and the complete graph minus a 1-factor into copies of a graph \(G\) where \(G\) is the union of two disjoint cycles, On Decomposing the Complete Graph into the Union of Two Disjoint Cycles, Constructions for optimal \((u\times v,\{3,4\},1,Q)\)-OOSPCs, Newi-Perfect Cycle Decompositions via Vertex Colorings of Graphs, Existence of strong difference families and constructions for eight new 2‐designs, New 2-designs from strong difference families, Cyclic cycle systems of the complete multipartite graph, Graph decompositions in projective geometries, Bounds and constructions for optimal \((n, \{3, 5 \}, \varLambda_a, 1, Q)\)-OOCs, Combinatorial constructions for optimal multiple-weight optical orthogonal signature pattern codes, The first families of highly symmetric Kirkman triple systems whose orders fill a congruence class, Constructions for cyclic Moebius ladder systems, On silver and golden optical orthogonal codes, Frame difference families and resolvable balanced incomplete block designs, Strong difference families, difference covers, and their applications for relative difference families, Strong difference families of special types, Combinatorial designs and the theorem of Weil on multiplicative character sums, Hadamard partitioned difference families and their descendants, Super-regular Steiner 2-designs

Cites Work

• Strongly graceful graphs
• A dynamic survey of graph labeling
• Cycle decompositions. IV: Complete directed graphs and fixed length directed cycles
• Balanced incomplete block designs with block size 9. II.
• Cyclic Hamiltonian cycle systems of the complete graph.
• Cyclic designs with block size 4 and related optimal optical orthogonal codes
• Existence of cyclic \(k\)-cycle systems of the complete graph
• Some constructions for cyclic perfect cycle systems
• Algebraic Graph Theory
• Cyclick-cycle systems of order 2kn +k: A solution of the last open cases
• Factorizations of complete multipartite graphs into generalized cubes
• On the cyclic decompositions of the complete graph into polygons with odd number of edges
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item