Abstract
For a block design \({\mathcal{D}}\) , a series of block intersection graphs G i , or i-BIG(\({\mathcal{D}}\)), i = 0, . . . ,k is defined in which the vertices are the blocks of \({\mathcal{D}}\) , with two vertices adjacent if and only if the corresponding blocks intersect in exactly i elements. A silver graph G is defined with respect to a maximum independent set of G, called an α-set. Let G be an r-regular graph and c be a proper (r + 1)-coloring of G. A vertex x in G is said to be rainbow with respect to c if every color appears in the closed neighborhood \({N[x] = N(x) \cup \{x\}}\) . Given an α-set I of G, a coloring c is said to be silver with respect to I if every \({x\in I}\) is rainbow with respect to c. We say G is silver if it admits a silver coloring with respect to some I. Finding silver graphs is of interest, for a motivation and progress in silver graphs see Ghebleh et al. (Graphs Combin 24(5):429–442, 2008) and Mahdian and Mahmoodian (Bull Inst Combin Appl 28:48–54, 2000). We investigate conditions for 0-BIG(\({\mathcal{D}}\)) and 1-BIG(\({\mathcal{D}}\)) of Steiner 2-designs \({{\mathcal{D}}=S(2,k,v)}\) to be silver.
Similar content being viewed by others
References
Alspach B., Hare D.: Edge-pancyclic block-intersection graphs. Discrete Math. 97(1–3), 17–24 (1991)
Alspach, B., Heinrich, K., Mohar, B.: A note on Hamilton cycles in block-intersection graphs. In: Finite Geometries and Combinatorial Designs (Lincoln, NE, 1987). Contemporary Mathematics, vol. 111, pp. 1–4. American Mathematical Society, Providence (1990)
Amini, O., Esperet, L., van den Heuvel, J.: A unified approach to distance-two colouring of planar graphs. In: SODA ’09: Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 273–282. Society for Industrial and Applied Mathematics, Philadelphia, PA, USA (2009)
Behzad, M., Mahmoodian, E.S.: Graphs versus designs—a quasisurvey. In: Graph Theory, Combinatorics, and Applications, vol. 1 (Kalamazoo, MI, 1988). Wiley-Interscience Publication, pp. 125–142. Wiley, New York (1991)
Colbourn, C.J., Dinitz, J.H. (eds.): Handbook of Combinatorial Designs. Discrete Mathematics and Its Applications (Boca Raton), 2nd edn. Chapman & Hall/CRC, Boca Raton (2007)
Donovan, D., Mahmoodian, E.S., Ramsay, C., Street, A.P.: Defining sets in combinatorics: a survey. In: Surveys in Combinatorics, 2003 (Bangor). London Mathematical Society Lecture Note Series, vol. 307, pp. 115–174. Cambridge University Press, Cambridge (2003)
Ghebleh M., Goddyn L.A., Mahmoodian E.S., Verdian-Rizi M.: Silver cubes. Graphs Combin. 24(5), 429–442 (2008)
Hare D.R.: Cycles in the block-intersection graph of pairwise balanced designs. Discrete Math. 137(1–3), 211–221 (1995)
Hare D.R., McCuaig W.: The connectivity of the block-intersection graphs of designs. Des. Codes Cryptogr. 3(1), 5–8 (1993)
Horák P., Pike D.A., Raines M.E.: Hamilton cycles in block-intersection graphs of triple systems. J. Combin. Des. 7(4), 243–246 (1999)
Kant, G., van Leeuwen, J.: The file distribution problem for processor networks. In: SWAT 90 (Bergen, 1990). Lecture Notes in Computer Science, vol. 447, pp. 48–59. Springer, Berlin (1990)
Kant, G., van Leeuwen, J.: Strong colorings of graphs (1990). http://igitur-archive.library.uu.nl/math/2006-1214-202846/UUindex.html
Kramer F., Kramer H.: A survey on the distance-colouring of graphs. Discrete Math. 308(2–3), 422–426 (2008)
van Lint J.H., Wilson R.M.: A Course in Combinatorics, 2nd edn. Cambridge University Press, Cambridge (2001)
Mahdian M., Mahmoodian E.S.: The roots of an IMO97 problem. Bull. Inst. Combin. Appl. 28, 48–54 (2000)
Mamut A., Pike D.A., Raines M.E.: Pancyclic BIBD block-intersection graphs. Discrete Math. 284(1–3), 205–208 (2004)
Pike D.A.: Hamilton decompositions of block-intersection graphs of Steiner triple systems. Ars Combin. 51, 143–148 (1999)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Ahadi, A., Besharati, N., Mahmoodian, E.S. et al. Silver Block Intersection Graphs of Steiner 2-Designs. Graphs and Combinatorics 29, 735–746 (2013). https://doi.org/10.1007/s00373-012-1174-y
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00373-012-1174-y