Abstract
In this paper we continue studying the independent transversal domination number in a graph, i.e., the cardinality of a smallest dominating set which intersects each maximum independent set. As our main result, we prove two upper bounds on the independent transversal domination number in terms of the order and minimum degree of a graph.
Original language | English |
---|---|
Pages (from-to) | 66-72 |
Number of pages | 7 |
Journal | Discrete Applied Mathematics |
Volume | 236 |
DOIs | |
Publication status | Published - 19 Feb 2018 |
Keywords
- Independent transversal domination number
- Upper bounds
ASJC Scopus subject areas
- Discrete Mathematics and Combinatorics
- Applied Mathematics