Simultaneous graph parameters: Factor domination and factor total domination

Let F1, F2, . . . , Fk be graphs with the same vertex set V . A subset S V is a factor dominating set if in every Fi every vertex not in S is adjacent to a vertex in S, and a factor total dominating set if in every Fi every vertex in V is adjacent to a vertex in S. The cardinality of a smallest such set is the factor (total) domination number. In this note we investigate bounds on the factor (total) domination number. These bounds exploit results on colorings of graphs and transversals of hypergraphs. Key words: cycles, bounds, factors, total domination

• Type: Journal
• Year: 2006
• Where: DM
• Authors: Peter Dankelmann, Michael A. Henning, Wayne Goddard, Renu Laskar
• Keywords: Cardinality, DM 2006, Dominating Set, Total Dominating