Realizable triples in dominator colorings
| dc.contributor.advisor | Gera, Ralucca | |
| dc.contributor.advisor | Rasmussen, Craig | |
| dc.contributor.author | Fletcher, Douglas M. | |
| dc.contributor.corporate | Naval Postgraduate School (U.S.) | |
| dc.contributor.department | Applied Mathematics | |
| dc.date.accessioned | 2012-03-14T17:38:08Z | |
| dc.date.available | 2012-03-14T17:38:08Z | |
| dc.date.issued | 2007-06 | |
| dc.description.abstract | Given a graph G and its vertex set V(G), the chromatic number, Chi(G), represents the minimum number of colors required to color the vertices of G so that no two adjacent vertices have the same color. The domination number of G, gamma(G), the minimum number of vertices in a set S, where every vertex in the set ( ) V G S is adjacent to a vertex in S. The dominator chromatic number of the graph, Chi subd (G) represents the smallest number of colors required in a proper coloring of G with the additional property that every vertex dominates a color class. The ordered triple, (a, b, c), is realizable if a connected graph G exists with gamma(G) = a, Chi(G) = b, and Chi subd (G) = c. For every ordered triple, (a, b, c) of positive integers, if either (a) a=1 and b=c greater or equal 2 or (b) 2 less than or equal a, b less than c and c less than or equal to a + b, , previous work has shown that the triple is realizable. The bounds do not consider the case . In an effort to realize all the ordered triples, we explore graphs and graph classes with a = b = c = k greater than or equal to 2. | en_US |
| dc.description.service | US Army (USA) author | en_US |
| dc.description.uri | http://archive.org/details/realizabletriple109453366 | |
| dc.format.extent | xiv, 27 p. : ill. | en_US |
| dc.identifier.oclc | 166345886 | |
| dc.identifier.uri | https://hdl.handle.net/10945/3366 | |
| dc.publisher | Monterey, California. Naval Postgraduate School | en_US |
| dc.rights | This 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. | en_US |
| dc.subject.lcsh | Graph theory | en_US |
| dc.title | Realizable triples in dominator colorings | en_US |
| dc.type | Thesis | en_US |
| dspace.entity.type | Publication | |
| etd.thesisdegree.discipline | Applied Mathematics | en_US |
| etd.thesisdegree.grantor | Naval Postgraduate School | en_US |
| etd.thesisdegree.level | Masters | en_US |
| etd.thesisdegree.name | M.S. | en_US |
| etd.verified | no | en_US |
Files
Original bundle
1 - 1 of 1