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
This thesis is an exposition of some sections of the tenth chapter of the book entitled Introductory...
Purpose of this note is to show that the existing Balanced Incomplete Block Designs with parameters ...
Domination in graphs is the fast growing area of research in Graph theory that has emerged rapidly i...
Let G = (V, E) be a graph. The smallest number of edges in any edge cover of and is called its edge ...
Abstract: In this paper, we obtain PBIB designs with association schemes which are arising from the ...
AbstractThis paper treats a class of combinatorial designs which are essentially partially balanced ...
AbstractThis paper treats a class of combinatorial designs which are essentially partially balanced ...
A new method for the construction of Symmetrical Balanced Incomplete Block designs is indicated whic...
AbstractBlackwelder (1969) has given two methods of constructing balanced incomplete block (BIB) des...
AbstractAn attempt has been made to construct partially balanced incomplete block designs of two and...
A dominating set D of a connected graph G=(V,E) is said to be bi-connected dominating set if the ...
An incomplete-block design defines both a concurrence graph and a Levi graph.Properties of either gr...
Consider the design that contains the blocks {1, 2, 4}, {1,2,5},{1,3,4},{1,3,6}, {2, 3, 5}, {2, 3, 6...
A (v, beta (o) , mu)-design over regular graph G = (V, E) of degree d is an ordered pair D = (V, B),...
This thesis is an exposition of some sections of the tenth chapter of the book entitled Introductory...
This thesis is an exposition of some sections of the tenth chapter of the book entitled Introductory...
Purpose of this note is to show that the existing Balanced Incomplete Block Designs with parameters ...
Domination in graphs is the fast growing area of research in Graph theory that has emerged rapidly i...
Let G = (V, E) be a graph. The smallest number of edges in any edge cover of and is called its edge ...
Abstract: In this paper, we obtain PBIB designs with association schemes which are arising from the ...
AbstractThis paper treats a class of combinatorial designs which are essentially partially balanced ...
AbstractThis paper treats a class of combinatorial designs which are essentially partially balanced ...
A new method for the construction of Symmetrical Balanced Incomplete Block designs is indicated whic...
AbstractBlackwelder (1969) has given two methods of constructing balanced incomplete block (BIB) des...
AbstractAn attempt has been made to construct partially balanced incomplete block designs of two and...
A dominating set D of a connected graph G=(V,E) is said to be bi-connected dominating set if the ...
An incomplete-block design defines both a concurrence graph and a Levi graph.Properties of either gr...
Consider the design that contains the blocks {1, 2, 4}, {1,2,5},{1,3,4},{1,3,6}, {2, 3, 5}, {2, 3, 6...
A (v, beta (o) , mu)-design over regular graph G = (V, E) of degree d is an ordered pair D = (V, B),...
This thesis is an exposition of some sections of the tenth chapter of the book entitled Introductory...
This thesis is an exposition of some sections of the tenth chapter of the book entitled Introductory...
Purpose of this note is to show that the existing Balanced Incomplete Block Designs with parameters ...
Domination in graphs is the fast growing area of research in Graph theory that has emerged rapidly i...