Distance domination versus iterated domination

Gábor Bacsó, Z. Tuza

Research output: Contribution to journalArticle

2 Citations (Scopus)

Abstract

A k-dominating set in a graph G is a set S of vertices such that every vertex of G is at distance at most k from some vertex of S. Given a class D of finite simple graphs closed under connected induced subgraphs, we completely characterize those graphs G in which every connected induced subgraph has a connected k-dominating subgraph isomorphic to some D∈D. We apply this result to prove that the class of graphs hereditarily D-dominated within distance k is the same as the one obtained by iteratively taking the class of graphs hereditarily dominated by the previous class in the iteration chain. This strong relation does not remain valid if the initial hereditary restriction on D is dropped.

Original languageEnglish
Pages (from-to)2672-2675
Number of pages4
JournalDiscrete Mathematics
Volume312
Issue number17
DOIs
Publication statusPublished - Sep 6 2012

Fingerprint

Domination
Induced Subgraph
Graph in graph theory
Finite Graph
Dominating Set
Vertex of a graph
Simple Graph
Subgraph
Isomorphic
Valid
Restriction
Iteration
Closed
Class

Keywords

  • Class of connected graphs
  • Distance domination
  • Dominating set
  • Forbidden induced subgraph

ASJC Scopus subject areas

  • Discrete Mathematics and Combinatorics
  • Theoretical Computer Science

Cite this

Distance domination versus iterated domination. / Bacsó, Gábor; Tuza, Z.

In: Discrete Mathematics, Vol. 312, No. 17, 06.09.2012, p. 2672-2675.

Research output: Contribution to journalArticle

Bacsó, Gábor ; Tuza, Z. / Distance domination versus iterated domination. In: Discrete Mathematics. 2012 ; Vol. 312, No. 17. pp. 2672-2675.
@article{61c9082f91f6401080f1f7bd1c546db1,
title = "Distance domination versus iterated domination",
abstract = "A k-dominating set in a graph G is a set S of vertices such that every vertex of G is at distance at most k from some vertex of S. Given a class D of finite simple graphs closed under connected induced subgraphs, we completely characterize those graphs G in which every connected induced subgraph has a connected k-dominating subgraph isomorphic to some D∈D. We apply this result to prove that the class of graphs hereditarily D-dominated within distance k is the same as the one obtained by iteratively taking the class of graphs hereditarily dominated by the previous class in the iteration chain. This strong relation does not remain valid if the initial hereditary restriction on D is dropped.",
keywords = "Class of connected graphs, Distance domination, Dominating set, Forbidden induced subgraph",
author = "G{\'a}bor Bacs{\'o} and Z. Tuza",
year = "2012",
month = "9",
day = "6",
doi = "10.1016/j.disc.2011.12.008",
language = "English",
volume = "312",
pages = "2672--2675",
journal = "Discrete Mathematics",
issn = "0012-365X",
publisher = "Elsevier",
number = "17",

}

TY - JOUR

T1 - Distance domination versus iterated domination

AU - Bacsó, Gábor

AU - Tuza, Z.

PY - 2012/9/6

Y1 - 2012/9/6

N2 - A k-dominating set in a graph G is a set S of vertices such that every vertex of G is at distance at most k from some vertex of S. Given a class D of finite simple graphs closed under connected induced subgraphs, we completely characterize those graphs G in which every connected induced subgraph has a connected k-dominating subgraph isomorphic to some D∈D. We apply this result to prove that the class of graphs hereditarily D-dominated within distance k is the same as the one obtained by iteratively taking the class of graphs hereditarily dominated by the previous class in the iteration chain. This strong relation does not remain valid if the initial hereditary restriction on D is dropped.

AB - A k-dominating set in a graph G is a set S of vertices such that every vertex of G is at distance at most k from some vertex of S. Given a class D of finite simple graphs closed under connected induced subgraphs, we completely characterize those graphs G in which every connected induced subgraph has a connected k-dominating subgraph isomorphic to some D∈D. We apply this result to prove that the class of graphs hereditarily D-dominated within distance k is the same as the one obtained by iteratively taking the class of graphs hereditarily dominated by the previous class in the iteration chain. This strong relation does not remain valid if the initial hereditary restriction on D is dropped.

KW - Class of connected graphs

KW - Distance domination

KW - Dominating set

KW - Forbidden induced subgraph

UR - http://www.scopus.com/inward/record.url?scp=84862691000&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84862691000&partnerID=8YFLogxK

U2 - 10.1016/j.disc.2011.12.008

DO - 10.1016/j.disc.2011.12.008

M3 - Article

VL - 312

SP - 2672

EP - 2675

JO - Discrete Mathematics

JF - Discrete Mathematics

SN - 0012-365X

IS - 17

ER -