A graph G is 2-stratified if its vertex set is partitioned into two 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 rooted at some blue vertex v. The F-domination number γ F(G) 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 every blue vertex v of G belongs to a copy of F rooted at v. In this paper we investigate the F-domination number for all 2-stratified graphs F of order n≤3 rooted at a blue vertex.
| Identifer | oai:union.ndltd.org:ETSU/oai:dc.etsu.edu:etsu-works-15192 |
| Date | 06 November 2003 |
| Creators | Chartrand, Gary, Haynes, Teresa W., Henning, Michael A., Zhang, Ping |
| Publisher | Digital Commons @ East Tennessee State University |
| Source Sets | East Tennessee State University |
| Detected Language | English |
| Type | text |
| Source | ETSU Faculty Works |
Page generated in 0.0021 seconds