Skip to content
Home
About Us
Resources
Profiles Metrics
Authors Directory
Institutions Directory
Top Authors
Top Institutions
Top Sponsors
AI Digest
Contact Us
Menu
Home
About Us
Resources
Profiles Metrics
Authors Directory
Institutions Directory
Top Authors
Top Institutions
Top Sponsors
AI Digest
Contact Us
Home
About Us
Resources
Profiles Metrics
Authors Directory
Institutions Directory
Top Authors
Top Institutions
Top Sponsors
AI Digest
Contact Us
Menu
Home
About Us
Resources
Profiles Metrics
Authors Directory
Institutions Directory
Top Authors
Top Institutions
Top Sponsors
AI Digest
Contact Us
Publication Details
AFRICAN RESEARCH NEXUS
SHINING A SPOTLIGHT ON AFRICAN RESEARCH
mathematics
Stratification and domination in graphs
Discrete Mathematics, Volume 272, No. 2-3, Year 2003
Notification
URL copied to clipboard!
Description
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. © 2003 Elsevier B.V. All rights reserved.
Authors & Co-Authors
Chartrand, Gary
United States, Kalamazoo
Western Michigan University
Haynes, Teresa W.
United States, Johnson
East Tennessee State University
Henning, Michael A.
South Africa, Durban
University of Kwazulu-natal
Zhang, Ping
United States, Kalamazoo
Western Michigan University
Statistics
Citations: 20
Authors: 4
Affiliations: 3
Identifiers
Doi:
10.1016/S0012-365X(03)00078-5
ISSN:
0012365X