On dominator colorings in graphs
MetadataShow full item record
Given a graph G, the dominator coloring problem seeks a proper coloring of G with the additional property that every vertex in the graph dominates an entire color class. We seek to minimize the number of color classes. We study this problem on several classes of graphs, as well as finding general bounds and characterizations. We also show the relation between dominator chromatic number, chromatic number, and domination number.
The article of record as published may be located at http://gtn.kazlow.info/GTN54.pdfGraph Theory Notes of New York LII, (2007) 25-30
RightsThis publication is a work of the U.S. Government as defined in Title 17, United States Code, Section 101. Copyright protection is not available for this work in the United States.
Showing items related by title, author, creator and subject.
Bender, Edward A.; Butler, Jon T. (1989-01);While the use of programmable logic arrays in modern logic design is common, little is known about what PLA size provides reasonable coverage in typical applications. We address this question by showing upper and ...
Tan Soon; Meng Alvin (Monterey, California. Naval Postgraduate School, 2007-06);Pressure on emergency medical services (EMS) is rising. The growth in EMS utilization has coincided with a decline in the number of emergency departments (ED). Between 1994 and 2004, the annual number of ED visits in the ...
Gulick, Stephen K.; Stahl, Scott D.; Larsen, Jayson C. (Monterey, California. Naval Postgraduate School, 2009-12);The purpose of this MBA Project was to answer the question of whether or not the Concurrent Certification (ConCert) program is working successfully on the E-2/C-2 aircraft production line. This study also determines if ...