Keywords
association schemes
PBIBD.
How to Cite
Abstract
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 C3°K2, and C4°K2. Finally, we determine the number of minimum dominating sets of graph G = Cn°K2 and prove that the set of all minimum dominating sets of G = Cn°K2 forms a partially balanced incomplete block design with two association scheme.
References
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.
This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.
Copyright (c) 2015 M.P. Sumathi, Anwar Alwardi