Affordable Access

A survey of stratified domination in graphs

Authors
Journal
Discrete Mathematics
0012-365X
Publisher
Elsevier
Publication Date
Volume
309
Issue
19
Identifiers
DOI: 10.1016/j.disc.2008.02.048
Keywords
  • Domination
  • Stratification
  • [Formula Omitted]-Coloring
  • [Formula Omitted]-Domination

Abstract

Abstract A graph G is 2-stratified if its vertex set is partitioned into two nonempty classes (each of which is a stratum or a color class). We color the vertices in one color class red and the other color class blue. Let F be a 2-stratified graph with one fixed blue vertex v specified. We say that F is rooted at v . The F -domination number of a graph G is the minimum number of red vertices of G in a red–blue coloring of the vertices of G such that for every blue vertex v of G , there is a copy of F in G rooted at v . In this paper, we survey recent results on the F -domination number for various 2-stratified graphs F .

There are no comments yet on this publication. Be the first to share your thoughts.

Statistics

Seen <100 times
0 Comments

More articles like this

A survey of selected recent results on total domin...

on Discrete Mathematics Jan 01, 2009

Independent domination in graphs: A survey and rec...

on Discrete Mathematics Apr 06, 2013
More articles like this..