Simultaneous domination in graphs
From MaRDI portal
Publication:489305
DOI10.1007/S00373-013-1353-5zbMATH Open1306.05177arXiv1301.4008OpenAlexW2085152491MaRDI QIDQ489305FDOQ489305
Authors: Yair Caro, Michael A. Henning
Publication date: 20 January 2015
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Abstract: Let be graphs with the same vertex set . A subset is a simultaneous dominating set if for every , , every vertex of not in is adjacent to a vertex in in ; that is, the set is simultaneously a dominating set in each graph . 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, , are -regular or the disjoint union of copies of . Further we study the case when each factor is a cycle.
Full work available at URL: https://arxiv.org/abs/1301.4008
Recommendations
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- A new bound for the 2/3 conjecture
- New approach to the \(k\)-independence number of a graph
- Factor domination in graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Factor domination and minimum degree
- Simultaneous graph parameters: factor domination and factor total domination
- Dominating a family of graphs with small connected subgraphs
Cited In (5)
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)