Loading...

On (1,2)-domination in cubic graphs

Fakharan, M. H ; Sharif University of Technology | 2021

1632 Viewed
  1. Type of Document: Article
  2. DOI: 10.1016/j.disc.2021.112546
  3. Publisher: Elsevier B.V , 2021
  4. Abstract:
  5. A (1,2)-dominating set in a graph G with minimum degree at least 2 is a set S of vertices of G such that every vertex in V(G)∖S has at least one neighbor in S and every vertex in S has at least two neighbors in S. The (1,2)-domination number, γ1,2(G), of G is the minimum cardinality of a (1,2)-dominating set of G. In this paper we prove that if G is a cubic graph of order n, then [Formula presented], and this bound is tight. © 2021 Elsevier B.V
  6. Keywords:
  7. (r,s)-domination ; Cubic graph ; Domination
  8. Source: Discrete Mathematics ; Volume 344, Issue 10 , 2021 ; 0012365X (ISSN)
  9. URL: https://www.sciencedirect.com/science/article/abs/pii/S0012365X21002594#!