Abstract
For a 2-(v, k, λ) design D, the incidence graph of D is a bipartite graph with vertex set P∪B, the point x∈P is adjacent to the block B∈B if and only if x is contained in B. In this paper, we investigate the domination number of the incidence graphs of symmetric 2-(v, k, λ) designs and Steiner systems. Moreover, we give a sufficient condition for a design to be super-neat, and thus prove that the finite projective planes and the finite affine planes are super-neat.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
