Strong difference families over arbitrary graphs
From MaRDI portal
Publication:3614742
DOI10.1002/jcd.20201zbMath1182.05016MaRDI 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
graceful labeling; relative difference family; \(\alpha\)-labeling; strong difference family; regular graph decomposition
05B10: Combinatorial aspects of difference sets (number-theoretic, group-theoretic, etc.)
05C78: Graph labelling (graceful graphs, bandwidth, etc.)
Related Items
On silver and golden optical orthogonal codes, Decompositions of complete graphs into circulants, Constructions of optimal variable-weight OOCs via quadratic residues, Bounds and constructions for optimal \((n, \{3, 5 \}, \varLambda_a, 1, Q)\)-OOCs, Combinatorial constructions for optimal multiple-weight optical orthogonal signature pattern codes, Constructions for cyclic Moebius ladder systems, Strong difference families, difference covers, and their applications for relative difference families, Combinatorial designs and the theorem of Weil on multiplicative character sums, 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, New 2-designs from strong difference families, Frame difference families and resolvable balanced incomplete block designs, Super-regular Steiner 2-designs, Cyclic balanced sampling plans excluding contiguous units with block size four, The first families of highly symmetric Kirkman triple systems whose orders fill a congruence class, Strong difference families of special types, Hadamard partitioned difference families and their descendants, Constructions for optimal \((u\times v,\{3,4\},1,Q)\)-OOSPCs, 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})\}}\), On Decomposing the Complete Graph into the Union of Two Disjoint Cycles, Newi-Perfect Cycle Decompositions via Vertex Colorings of Graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- 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
