Simultaneous domination in graphs

DOI10.1007/S00373-013-1353-5MaRDI QIDQ489305zbMATH OpenOpenAlexFDO

Authors Yair Caro, Michael A. Henning

Publication date 20 January 2015

Published in Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1301.4008

zbMATH Keywords

factor domination

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Abstract: Let $F_1,F_2,\mathrm{...},F_k$ be graphs with the same vertex set $V$. A subset $SsubseteqV$ is a simultaneous dominating set if for every $i$, $1leilek$, every vertex of $F_i$ not in $S$ is adjacent to a vertex in $S$ in $F_i$; that is, the set $S$ is simultaneously a dominating set in each graph $F_i$. The cardinality of a smallest such set is the simultaneous domination number. We present general upper bounds on the simultaneous domination number. We investigate bounds in special cases, including the cases when the factors, $F_i$, are $r$-regular or the disjoint union of copies of $K_r$. Further we study the case when each factor is a cycle.

Recommendations

• Simultaneous graph parameters: factor domination and factor total domination
• Factor domination in graphs
• Simultaneously dominating all spanning trees of a graph
• On upper bounds for multiple domination numbers of graphs
• Domination versus independent domination in graphs of small regularity

Cites work

• scientific article; zbMATH DE number 4204392 (Why is no real title available?)
• scientific article; zbMATH DE number 4063149 (Why is no real title available?)
• scientific article; zbMATH DE number 1095171 (Why is no real title available?)
• scientific article; zbMATH DE number 1095172 (Why is no real title available?)
• scientific article; zbMATH DE number 1124604 (Why is no real title available?)
• A new bound for the 2/3 conjecture
• Dominating a family of graphs with small connected subgraphs
• Factor domination and minimum degree
• Factor domination in graphs
• New approach to the \(k\)-independence number of a graph
• Simultaneous graph parameters: factor domination and factor total domination

Cited in

(4)

• Simultaneous graph parameters: factor domination and factor total domination
• Global domination
• Simultaneously dominating all spanning trees of a graph
• On simultaneous domination and mixed connectivity in graphs

This page was built for publication: Simultaneous domination in graphs

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