Skip to main content
Log in

PBIB-Designs from Certain Subsets of Distance-Regular Graphs

  • Original Paper
  • Published:
Bulletin of the Iranian Mathematical Society Aims and scope Submit manuscript

Abstract

Partially balanced incomplete block (PBIB)-designs are well known to be the generalization of combinatorial 2-designs. In this paper, we first construct PBIB-designs from diametral paths of distance-regular graphs, which generalizes the result for strongly regular graphs. Furthermore, for Q-polynomial distance-regular graphs associated with regular semilattices, we obtain the construction of PBIB-designs through descendents with fixed dual width.

This is a preview of subscription content, log in via an institution to check access.

Access this article

We’re sorry, something doesn't seem to be working properly.

Please try refreshing the page. If that doesn't work, please contact support so we can address the problem.

Similar content being viewed by others

References

  1. Bang, S., Hiraki, A., Koolen, J.H.: Delsarte clique graphs. Eur. J. Combin. 28(2), 501–516 (2007)

    Article  MathSciNet  Google Scholar 

  2. Bannai, E., Bannai, E., Ito, T., Tanaka, R.: Algebraic Combinatorics. De Gruyter, Berlin, Boston (2021)

    Book  Google Scholar 

  3. Bannai, E., Ito, T.: Algebraic Combinatorics I: Association Schemes. Benjamin/Cummings, Menlo Park, CA (1984)

    Google Scholar 

  4. Bose, R.C., Nair, K.R.: Partially balanced incomplete block designs. Sankhyā 4, 337–372 (1939)

    Google Scholar 

  5. Brouwer, A.E., Cohen, A.M., Neumaier, A.: Distance regular graphs. Springer-Verlag, Berlin (1989)

    Book  Google Scholar 

  6. Brouwer, A.E., Godsil, C.D., Koolen, J.H., Martin, W.J.: Width and dual width of subsets in polynomial association schemes. J. Combin. Theory Ser. A 102(2), 255–271 (2003)

    Article  MathSciNet  Google Scholar 

  7. Buckley, F., Harary, F.: Distance in graphs. Assison-Wesley, (1990)

  8. Chaluvaraju, B., Hosamani, S.M., Diwakar, S.A.: Graph theoretic parameters associated with PBIB design via partial geometries of generalized polygon. South East Asian J. Math. Math. Sci. 16(1), 29–42 (2020)

    MathSciNet  Google Scholar 

  9. Delsarte, P.: Association schemes and t-designs in regular semilattices. J. Combin. Theory Ser. A 20(2), 230–243 (1976)

    Article  MathSciNet  Google Scholar 

  10. Feit, W., Higman, G.: The nonexistence of certain generalized polygons. J. Algebra 1(2), 114–131 (1964)

    Article  MathSciNet  Google Scholar 

  11. Huigol, M.I., Vidya, M.D.: Partially balanced incomplete block (PBIB)-designs arising from diametral paths in some strongly regular graphs. Discrete Math. Algorithms Appl. 15(7), 2250163 (2023)

    Article  MathSciNet  Google Scholar 

  12. Huigol, M.I., Vidya, M.D.: Partially balanced incomplete block (PBIB)-designs associated with geodetic sets in graphs. Discrete Math. Algorithms Appl. 15(1), 2250059 (2023)

    Article  MathSciNet  Google Scholar 

  13. Shirkol, S.S., Gudgeri, M.C., Shekharappa, H.G.: Partially balanced incomplete block designs arising from minimum total dominating sets in a graphs. J. Math. Res. 5(1), 119–126 (2013)

    Google Scholar 

  14. Suda, S.: A generalization of the Erdös-Ko-Rado theorem to \(t\)-designs in certain semilattices. Discrete Math. 312(10), 1827–1831 (2012)

    Article  MathSciNet  Google Scholar 

  15. Tanaka, H.: Classification of subsets with minimal width and dual width in Grassmann, bilinear forms and dual polar graphs. J. Combin. Theory Ser. A 113(5), 903–910 (2006)

    Article  MathSciNet  Google Scholar 

  16. Tanaka, H.: Vertex subsets with minimal width and dual width in Q-polynomial distance-regular graphs. Electron. J. Combin. 18(1), 167 (2011)

    Article  MathSciNet  Google Scholar 

  17. Tanaka, H.: The Erdös-Ko-Rado theorem for twisted Grassmann graphs. Combinatorica 32(6), 735–740 (2012)

    Article  MathSciNet  Google Scholar 

  18. Walikar, H.B., Acharya, B.D., Shirkol, S.S.: Designs associated with maximum independent sets of a graph. Designs Codes Cryptogr. 57(1), 91–105 (2010)

    Article  MathSciNet  Google Scholar 

  19. Wan, Z.: Notes on finite geometries and the construction of PBIB designs VI, Some association schemes and PBIB designs based on finite geometries. Acta Scientia Sinica 14(12), 1872–1876 (1965)

    MathSciNet  Google Scholar 

  20. Zhu, Y.: Optimal and extremal graphical designs on regular graphs associated with classical parameters. Designs Codes Cryptogr. 91, 2737–2754 (2023)

    Article  MathSciNet  Google Scholar 

Download references

Acknowledgements

The authors sincerely thank the anonymous referees for pointing out errors and many valuable suggestions to improve our results. Yan Zhu is supported by National Natural Science Foundation of China No. 11801353 and the Fundamental Research Funds for the Central Universities.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Yan Zhu.

Additional information

Communicated by Ebrahim Ghorbani.

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Li, N., Zhu, Y. PBIB-Designs from Certain Subsets of Distance-Regular Graphs. Bull. Iran. Math. Soc. 50, 15 (2024). https://doi.org/10.1007/s41980-024-00859-y

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • DOI: https://doi.org/10.1007/s41980-024-00859-y

Keywords

Navigation