Keywords:-
Article Content:-
Abstract
A $(v, b, \gamma_{bc}, r, \lambda_{i})$-design over regular graph $G = (V, E)$ of degree $k$ is an ordered pair $D = (V, B)$, where $|V| = v$ and $B$ is the set of bi-connected dominating sets of $G$ called blocks such that two vertices $\alpha$ and $\beta$ which are $i^{th}$ associates occur together in $ \lambda_{i}$ blocks, the numbers $\lambda_{i}$ being independent of the choice of the pair $\alpha$ and $\beta$. In this paper, we obtain Partially Balanced Incomplete Block (PBIB)-designs arising from bi-connected dominating sets in cubic graphs. Also, we give a complete list of PBIB-designs with respect to the bi-connected dominating sets for cubic graphs of order at most $12$. The discussion of non-existence of some designs corresponding to bi-connected dominating sets from certain graphs concludes the article.
References:-
References
F. Buckley, F. Harary, Distance in graphs, Addison-Wesley (1990).
F. C. Bussemaker, S. Cobeljic, D. M. Cvetkovic, J. J. Seidel, ``Computer investigation of cubic graphs," T.H. Report 76-WSK-01, Department of Mathematics, Technological University, Eindhoven, The Netherlands, (1976).
B. Chaluvaraju, N. Manjunath, ``PBIB-Designs and Association schemes arising from minimum connected dominating sets of a graph", textit{textbf{South Asian Journal of Mathematics}}, 4(5) 225-232 (2014).
B. Chaluvaraju, N. Manjunath, `PBIB-Designs and Association schemes arising from minimum bi-connected dominating sets of a graph", Africa Mathematika, (2017).
C. J. Colbourn, J. H. Dinitz, Handbook of Combinatorial Designs, 2nd Edition, CRC Press, Boca Raton, (2007).
T. W. Haynes, S. T. Hedetniemi, P. J. Slater,`` Fundamentals of Domination in Graphs", Marcel Dekker Inc,New York (1998).
Medha Itagi Huilgol, Vidya M. D., ``Partially balanced incomplete block (PBIB)-designs arising from geodetic sets in graphs", textit{textbf{Discrete mathematics, algorithms and applications}}, vol 15 (2022) 2250059(1-17).
Medha Itagi Huilgol, Vidya M. D., ``Partially balanced incomplete block (PBIB)-designs arising from diametral paths in some strongly regular graphs", textit{textbf{Discrete mathematics, algorithms and applications}}, vol 15 (2023) 2250163(1-27) .
Medha Itagi Huilgol, Vidya M. D., ``Partially balanced incomplete block (PBIB)-designs arising from bi-connected dominating sets of strongly regular graphs", (Communicated).
J. W. Paola, ``Block designs and graph theory," textit{textbf{Journal of Combinatorial Theory}}, 1 (1966) 132-148.
D. Raghavarao, Construction and combinatorial problems in design of experiments, John Wiley, NewYork (1971).
H. B. Walikar, B. D. Acharya, S. Shirkol, ``Designs associated with maximum independent sets of graph", textit{textbf{Designs Codes and Cryptography}}, 57 (2010) 91-105.