Degree- and Orbit-Balanced Γ-Designs When Γ Has Five Vertices

DOI10.1002/jcd.21348zbMath1276.05010OpenAlexW1505407872MaRDI QIDQ2864794

Simona Bonvicini

Publication date: 26 November 2013

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

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

zbMATH Keywords

automorphism groupbalanced designsgroup divisible designs

Mathematics Subject Classification ID

Combinatorial aspects of block designs (05B05) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) General block designs in finite geometry (51E05)

Related Items (3)

Tree-designs with balanced-type conditions ⋮ Edge balanced star‐hypergraph designs and vertex colorings of path designs ⋮ Local balance in graph decompositions

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Balanced and strongly balanced \(P_k\)-designs
• Graph designs for the eight-edge five-vertex graphs
• A new class of group divisible designs with block size three
• Another class of balanced graph designs: Balanced circuit designs
• Balanced incomplete block designs and related designs
• Some progress on \((v,4,1)\) difference families and optical orthogonal codes
• On the construction of handcuffed designs
• Even cycles and even 2-factors in the line graph of a simple graph
• Graph decompositions, handcuffed prisoners and balanced p-designs
• An existence theory for pairwise balanced designs. I: Composition theorems and morphisms
• Minimizing drop cost for SONET/WDM networks with ? wavelength requirements
• A survey on the existence ofG-Designs
• On the Existence of $(K_5 \setminuse)$-Designs with Application to Optical Networks
• On perfect Γ-decompositions of the complete graph

This page was built for publication: Degree- and Orbit-Balanced Γ-Designs When Γ Has Five Vertices