PBIB-DESIGNS AND MATRIX FORM OF ASSOCIATION SCHEMES ARISING FROM MINIMUM EDGE COVERING SETS OF SOME CIRCULANT GRAPHSJournal: International Journal of Engineering Sciences & Research Technology (IJESRT) (Vol.7, No. 3)
Publication Date: 2018-03-31
Authors : B. Chaluvaraju; Shaikh Ameer Basha;
Page : 508-513
Keywords : Edge cover; PBIB-Designs; matrix; association schemes & Circulant graphs.;
Let G = (V, E) be a graph. The smallest number of edges in any edge cover of G and is called its edge covering number α1 In this paper, we obtain the total number of α1-sets, the Partially Balanced Incomplete Block (PBIB)- Designs on minimum α1-sets of Circulant graphs with m-association schemes for 1 ≤ m ≤ ⌊ p 2 ⌋.
Other Latest Articles
Last modified: 2018-03-17 20:21:11