• PARTIAL BALANCED INCOMPLETE BLOCK DESIGNS ARISING FROM SOME MINIMAL DOMINATING SETS OF SRNT GRAPHS
Abstract
In this paper we prove that the set of all minimal dominating sets which induced from the neighbourhoods of Clepsch graph with parameters are blocks of partial balanced incomplete block designs, and we generalize this result for minimal dominating sets for all strongly regular graphs without triangles.
Keywords: Clebsch graph, Strongly regular graph without triangles, Minimal dominating set, Partial balanced incomplete block design.
Mathematics Subject Classification (2000):05C15.
Keywords: Clebsch graph, Strongly regular graph without triangles, Minimal dominating set, Partial balanced incomplete block design.
Mathematics Subject Classification (2000):05C15.
Keywords
Clebsch graph, Strongly regular graph without triangles, Minimal dominating set, Partial balanced incomplete block design.
Full Text:
PDFThis work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License.
© 2010-2024 International Journal of Mathematical Archive (IJMA) Copyright Agreement & Authorship Responsibility |