Further Results on Designs Arising from Some Certain Corona Graphs


Minimum dominating sets
association schemes

How to Cite

Sumathi, M., & Alwardi, A. (2015). Further Results on Designs Arising from Some Certain Corona Graphs. Journal of Advances in Applied & Computational Mathematics, 2(1), 19–23. https://doi.org/10.15377/2409-5761.2014.02.01.4


In this paper, we determine the partially balanced incomplete block designs and association scheme which are formed by the minimum dominating sets of the graphs CK2, and CK2. Finally, we determine the number of minimum dominating sets of graph G = CK2 and prove that the set of all minimum dominating sets of G = CK2 forms a partially balanced incomplete block design with two association scheme.



Anwar Alwardi, ND Soner. Partial balanced incomplete block designs arising from some minimal dominating sets of SRNT graphs. Int Jour of Math Arch 2011; 2(2): 233-235.

PJ Cameron, JH. Van Lint. Designs, graphs, Codes and their links, vol. 22 of London Mathematical Society Student Texts. Cambridge University Press, Cambridge 1991.

F Harary. Graph theory Addison-Wesley Reading Mass 1969.

MP Sumathi. Some Designs with Association Schemes Arising from Some Certain Corona Graphs. International Journal of Scientific and Innovative Mathematical Research (IJSIMR) October 2014; 2(10): 819-826.

HB Walikar, HS Ramane, BD Acharya, HS Shekhareppa, S Arumugum. Partially balanced incomplete block design arising from minimum dominating sets of paths and cycles. AKCE J Graphs Combin 2007; 4(2): 223-232.

Creative Commons License

This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.

Copyright (c) 2015 M.P. Sumathi, Anwar Alwardi