Name
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. |
Year | DOI | Venue |
|---|---|---|
2009 | 10.1016/j.disc.2008.02.048 | Discrete Mathematics |
Keywords | Field | DocType |
f -coloring,f-domination,domination,f -domination,stratification,f-coloring,domination number | Wheel graph,Discrete mathematics,Combinatorics,Bound graph,Fractional coloring,Graph power,Vertex (graph theory),Cycle graph,Neighbourhood (graph theory),Mathematics,Graph coloring | Journal |
Volume | Issue | ISSN |
309 | 19 | Discrete Mathematics |
Citations | PageRank | References |
1 | 0.38 | 11 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Teresa W. Haynes | 1 | 774 | 94.22 |
| Michael A. Henning | 2 | 1865 | 246.94 |
| Ping Zhang | 3 | 60 | 14.50 |