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 Edit this on Wikidata


Publication date: 20 January 2015

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

Abstract: Let F1,F2,...,Fk be graphs with the same vertex set V. A subset SsubseteqV is a simultaneous dominating set if for every i, 1leilek, every vertex of Fi not in S is adjacent to a vertex in S in Fi; that is, the set S is simultaneously a dominating set in each graph Fi. 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, Fi, are r-regular or the disjoint union of copies of Kr. 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


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)