ON THE EMBEDDING OF GROUPS AND DESIGNS IN A DIFFERENCE BLOCK DESIGN
Abstract
A difference BIBD is a balanced incomplete block design on a group which is
constructed by transferring a regular perfect difference system by a subgroup of its point set. There is an obvious bijection between these BIBDs and some copies of their point sets as two sets. In this paper, we investigate the algebraic structure of these block designs by definning a group-isomorphism between them and their point sets. It has done by defning some relations between the independent-graphs of difference BIBDs and some Cayley graphs of their point sets. It is shown that some Cayley graphs are embedded in the independent-graph of difference BIBDs as a spanning sub-graphs. Due to find these relations, we find out a configuration ordering on these BIBDs, also we achieve some results about the classification of these BIBDs. All in this paper are on difference BIBDs with even numbers of the points.
Keywords
Full Text:
PDFReferences
bibitem{cageggi 2017}
A. Caggegi and G. Falcone and M. Pavone:
{em On the additivity of block designs.}
J. Algebraic Combin.,
{bf 45}(1) (2017), 271-294.
bibitem{rosa colbourn}
C. J. Colbourn and A. Rosa:
{em Triple systems}.
OxfordMathematical Monographs,
The Clarendon Press Oxford University Press: New York, USA, 1999.
bibitem{handbook}
C. J. Colbourn and J. H. Dinitz:
{em Handbook of combinatorial designs, Second edition}.
Discrete Mathematics and its Applications (Boca Raton),
Chapman & Hall/CRC: Boca Raton, FL, 2007.
bibitem{productcayley}
D. Cvetkovic and P.Rowlinson and S. Simic:
{em An introduction to the theory of graph spectra}.
London Mathematical Society Student Texts,
{bf 75};
Cambridge University Press: Cambridge, Britannia, 2010.
bibitem{stinson ea}
D. R. Stinson and R. Wei and L. Zhu:
{em New constructions for perfect Hash families and related structures using combinatorial designs and codes.}
J. Combin. Des.,
{bf 8}(2000), No. 3, 189-200.
bibitem{perfect diff}
G. Ge and M. Ying and S. Xianwei:
{em Perfect difference families, perfect difference matrices, and related combinatorial structures.}
J. Combin. Des.,
{bf 18} (20180), No. 6, 65-78.
bibitem{lambda fold op}
G. Lo Faro and A. Tripodi:
{em Embeddings of $lambda$ fold Kite systems, $lambdageq 2$.}
Australas.J. Combin.,
{bf 36} (2006), 143-150.
bibitem{social media}
J. Beel and B. Gipp:
{em Google Scholarâs Ranking Algorithm: An Introductory Overview. }
{Proceedings of the 12th International Conference on Scientometrics and Informetrics}.
{bf 1}(2009), 230-241.
bibitem{dihedral}
K. Conrad:
{em Dihedral Groups.}
Retrieved from: textit{http://www.math.uconn.edu/kconrad/blurbs/grouptheory/dihedral.pdf.}
bibitem{dewar}
M. Dewar and B. Stevens:
{em Ordering block designs, Gray code, Universal cycles and configuration orderings}.
CMS Books in Mathematics/Ouvrages de Mathematiques de la SMC; Springer: New York, USA, 2012.
bibitem{k3 in bibd}
M. Gionfriddo and S. Milici:
{em Minimum embedding of a $K_3$-design into a balanced incomplete block design of index $lambda geq 2$}
Ars Combin.,
{bf 112} (2013), 279-291.
bibitem{steiner in steiner op}
M. Meszka and A. Rosa:
{em Embedding Steiner systems into Steiner systems $S(2; 4, nu)$.}
Discrete Math.,
{bf 274} (2004), No. 1-3 199-212.
bibitem{cayley connection}
PH. Zieschang:
{em Cayley graphs of finite groups.}
J. Algebra,
{bf 118} (1988), No. 2, 447-454.
bibitem{embeding 2015}
P. J. Dukes and T. Feng and A. C. H. Ling:
{em A finite embedding theorem for partial Steiner 3-designs.}
Finite Fields Appl.,
{bf 33} (2015), 29-36.
bibitem{scheme}
R. A. Bailey:
em{ Association Schemes Designed experiments Algebra and Combinatorics}.
Cambridge University Pres: New York, USA, 2004.
bibitem{sagnol}
R. A Baily and P. J. Cameron:
em{Using graphs to find the best block designs, Topics in structural graph theory.}
Encyclopedia Math. Appl.,
Cambridge Univ. Press, Cambridge, {textbf 147} (2013).
bibitem{bose39}
R. C. Bose:
{em On the construction of balanced incomplete block designs. }
Ann. Eugenics,
{bf 9} (1939), 353-399.
bibitem{toeplitz}
R. Euler:
{em Coloring planar Toeplitz graphs and the stable set polytope.}
th International Conference on Graph Theory,
Discrete Math.,
{bf 276} (2004), No. 1-3, 183-200.
bibitem{auto 2002}
R. Fuji-Hara and Y. Miao and S. Shinohara:
{em Complete sets of disjoint difference families and their applications. Experimental design and related combinatorics.}
J. Statist. Plann. Inference,
{bf 106} (2002), No. 1-2, 87-103.
bibitem{sheng}
S. Bau:
{em A generalization of the concept of Toeplitz graphs.}
Mong. Math. J. ,
{bf 15} (2011), 54-61.
bibitem{phd thesis}
S. Chisaki:
{em difference systems of sets and their construction}.
Graduate School of Science and Technology;
Tokyo University of Science: Tokyo, Japan, 2016.
bibitem{h in g 2013}
S. Kucukcifci and G. Quattrocchi and B. R. Smith and E. S. Yzici:
{em On regular embedding of $H$-designs into $G$-designs.}
Util. Math,
{bf 92} (2013), 97-127.
bibitem{e in h 2014}
S. Milici:
{em Maximum embedding of an $E_2(nu â omega, 4, 1)$ into an $H(nu, 4, lambda)$.}
Util. Math.,
{bf 93} (2014), 383-391.
bibitem{ogata}
W. Ogataa and K. Kurosawa and D. R. Stinson and H. Saido:
{em New combinatorial designs and their applications to authentication codes and secret sharing Schemes.}
Discrete Math.,
{bf 279} (2004), No. 1-3, 383-405.
DOI: https://doi.org/10.22190/FUMI200322009T
Refbacks
- There are currently no refbacks.
ISSN 0352-9665 (Print)