Domination number of incidence graphs of block designs

Lang Tang, Shenglin Zhou and Jing Chen

Applied Mathematics and Computation, 2019, vol. 363, issue C, -

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.

Keywords: Designs; Steiner systems; Incidence graphs; Domination number (search for similar items in EconPapers)
Date: 2019
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0096300319305922
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:apmaco:v:363:y:2019:i:c:1

DOI: 10.1016/j.amc.2019.124600

Access Statistics for this article

Applied Mathematics and Computation is currently edited by Theodore Simos

More articles in Applied Mathematics and Computation from Elsevier
Bibliographic data for series maintained by Catherine Liu ().