PBIB-designs with constant block sums arising from different graph parameters
*Medha Itagi HuilgolCorresponding authormedha@bub.ernet.inDepartment of MathematicsBengaluru City UniversityCentral College CampusBengaluru, Karnataka, 560001, IndiaView full profile → , Sreepriya Asoksreepriyaasok1995@gmail.comDepartment of MathematicsBengaluru City UniversityCentral College CampusBengaluru, Karnataka, 560001, IndiaView full profile →
* Corresponding author · click or hover a name for details
- Received:
- 08 Nov 2023
- Published Online:
- 15 Sep 2025
- Article type:
- Research Article
- Language:
- EN
- Article no.:
- JDMSC-2064
- Pages:
- 2697–2721
Abstract
Keywords
Subject Classifications
References
[1] R. C. Bose and K. R. Nair, “Partially balanced incomplete block designs,” Sankhya, vol. 4, pp. 337–372 (1939).
[2] R. Khattree, “The Parshvanath yanthram yields a constant-sum partially balanced incomplete block design,” Commun. Stat. Theory Methods, vol. 48, no. 4, pp. 841–849 (2019).
[3] R. Khattree, “A note on the nonexistence of the constant block sum balanced incomplete block design,” Commun. Stat. Theory Methods, vol. 48, no. 20, pp. 5165–5168 (2019).
[4] R. Khattree, “On construction of constant block-sum partially balanced incomplete block designs,” Commun. Stat. Theory Methods, vol. 49, no. 11, pp. 2585–2606 (2020).
[5] R. Khattree, “On construction of equireplicated constant block-sum designs,” Commun. Stat. Theory Methods, vol. 51, no. 13, pp. 4434–4450 (2022).
[6] N. Bansal and D. K. Garg, “Construction and existence of constant block sum PBIB designs,” Commun. Stat. Theory Methods, vol. 47, no. 24, pp. 1–11 (2020).
[7] S. Gupta, “Constant block-sum two-associate class group divisible designs,” Stat. Appl., vol. 19, no. 1, pp. 141–148 (2021).
[8] P. Kaura and K. Sharma, “Constant block-sum Youden-m square and PBIB designs using Galois field,” Commun. Stat. Simul. Comput., vol. 52, no. 11, pp. 5396–5400 (2023).
[9] R. C. Bose and M. S. Shrikhande, “On a class of Partially Balanced Incomplete Block Designs,” J. Stat. Plan. Inference, vol. 3, pp. 91–99 (1979).
[10] M. I. Huilgol and M. D. Vidya, “BIB designs associated with minimum biconnected dominating sets of hypercubes,” Afrika Matematika, vol. 31, pp. 1009–1028 (2020).
[11] M. I. Huilgol and M. D. Vidya, “Partially balanced incomplete block (PBIB)-designs arising from diametral paths in graphs,” Design Engineering, no. 2022-01, pp. 622–635 (2022).
[12] M. I. Huilgol and M. D. Vidya, “Partially balanced incomplete block (PBIB)-designs arising from geodetic sets of graphs,” Discrete Math. Algorithms Appl., vol. 5, no. 1, pp. 2250059–2250076 (2023).
[13] M. I. Huilgol and M. D. Vidya, “Partially Balanced Incomplete Block designs arising from geodetic sets in circulant graphs,” J. Syst. Eng. Electron., vol. 34, no. 3, pp. 220–230 (2024).
[14] M. I. Huilgol and M. D. Vidya, “Partially balanced incomplete block (PBIB)-designs arising from diametral paths in some strongly regular graphs,” Discrete Math. Algorithms Appl., vol. 15, pp. 2250059–2250076 (2023).
[15] H. Ibrahim, R. Ramli, and M. H. Hassan, “Combinatorial design for a conference: constructing a balanced three-parallel session schedule,” J. Discrete Math. Sci. Cryptogr., vol. 11, no. 3, pp. 305–317 (2008).
[16] S. Innamorati and G. L. Faro, “Constructing Steiner triple systems partially embedded in a projective plane,” J. Inf. Optim. Sci., vol. 13, no. 2, pp. 267–277 (1992).
[17] Y. J. Ionin and M. S. Shrikhande, “On classification of two class partially balanced designs,” J. Stat. Plann. Inference, vol. 95, pp. 209–228 (2001).
[18] H. L. Jen, T. C. Hsia, and M. B. Hasan, “A study of methods for construction of balanced incomplete block design,” J. Discrete Math. Sci. Cryptogr., vol. 10, no. 2, pp. 227–243, 2007.
[19] H. B. Walikar, B. D. Acharya, and S. S. Shirkol, “Designs associated with maximum independent sets of a graph,” Des. Codes Cryptogr., vol. 57, pp. 91–105, 2007.
[20] F. Buckley and F. Harary, Distance in Graphs, Boston, MA: Addison-Wesley (1990).
[21] C. J. Colbourn and J. H. Dinitz, Handbook of Combinatorial Designs, 2nd ed., Boca Raton, FL: CRC Press (2007).
[22] D. B. West, Introduction to Graph Theory, Upper Saddle River, NJ: Prentice Hall (1996).
[23] P. J. Cameron and J. H. van Lint, Graphs, Codes and Designs, Cambridge, U.K.: Cambridge Univ. Press (1980).
[24] A. Ekpo, J. A. Ikughur, M. E. Nja, and S. C. Nwaosu, “Comparison of robustness of two partially balanced incomplete block designs [PBIBD(2)] using optimality criteria,” Asian J. Math. Stat., vol. 14, no. 1, pp. 1–12 (2021).
[25] S. Foldes, “A characterization of hypercubes,” Discrete Math., vol. 17, pp. 155–159 (1977).
[26] J. Kahn and J. Park, “The number of maximal independent sets in the Hamming cube,” arXiv preprint, arXiv:1909.04283 (2019). [Online]. Available: https://arxiv.org/abs/1909.04283
[27] S. S. Sane, “The Shrikhande Graph,” Resonance, vol. 20, no. 10, pp. 903–918 (Oct. 2015).
