Affiliation:
1. Department of Mathematics, Yıldız Technical University, İstanbul, Turkey
Abstract
In this article, we adapt the edge-graceful graph labeling definition into block designs and define a block design
with
and
as block-graceful if there exists a bijection
such that the induced mapping
given by
is a bijection. A quick observation shows that every
BIBD that is generated from a cyclic difference family is block-graceful when
. As immediate consequences of this observation, we can obtain block-graceful Steiner triple system of order
for all
and block-graceful projective geometries, i.e.,
BIBDs. In the article, we give a necessary condition and prove some basic results on the existence of block-graceful
BIBDs. We consider the case
for Steiner triple systems and give a recursive construction for obtaining block-graceful triple systems from those of smaller order which allows us to get infinite families of block-graceful Steiner triple systems of order
for
. We also consider affine geometries and prove that for every integer
and
, where
is an odd prime power or
, there exists a block-graceful
BIBD. We make a list of small parameters such that the existence problem of block-graceful labelings is completely solved for all pairwise nonisomorphic BIBDs with these parameters. We complete the article with some open problems and conjectures.
Reference11 articles.
1. A dynamic survey of graph labeling;J. A. Gallian;Electronic Journal of Combinatorics,2019
2. Zero-sum flows for triple systems
3. Zero-sum flows in designs
4. Egalitarian Steiner triple systems for data popularity
5. 2-(v,k,λ)-Designs of small order;R. Mathon,2007