Simultaneous graph parameters: factor domination and factor total domination

DOI10.1016/J.DISC.2006.04.017MaRDI QIDQ2509300zbMATH OpenOpenAlexFDO

Authors Peter Dankelmann, Michael A. Henning, Renu C. Laskar, Wayne Goddard

Publication date 19 October 2006

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.disc.2006.04.017

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Review text

Let \(F_1,F_2,\dots,F_k\) be \(k\) factors of a graph \(G\). A subset \(S\) of \(V(G)\) is a factor dominating set if in every \(F_i\) every vertex not in \(S\) is adjacent to a vertex in \(S\), and a factor total dominating set if in every \(F_i\) every vertex in \(V(G)\) is adjacent to a vertex in \(S\). The cardinality of a smallest such set is called the factor (total) domination number. The authors present some upper bounds on the factor (total) domination number. These bounds exploit results on colorings of graphs and transversals of hypergraphs.

Recommendations

Cited in

(6)

This page was built for publication: Simultaneous graph parameters: factor domination and factor total domination

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2509300)