Master of Science (MS)
Civil and Environmental Engineering
First Committee Member
Number of Pages
A power coloring of a graph G is a mapping c : V (G) → N that assigns colors to the vertices of G in such a way that adjacent vertices are labeled with different colors. A coloring c is called a 4-local coloring if for every subset S ⊆ V (G), with 2 ≤ |S| ≤ 4 there are two vertices u, v such that the difference between colors of u and v, is greater than or equal to the number of edges in the subgraph induced by S. That is, ∀S∃u,v∈ S∋&vbm0;cu-c v&vbm0;≥ms, where ms is the number of edges subgraph induced by S, ms = |E()|. The maximum color assigned by a local coloring c to a vertex of G is c4c= maxcv &vbm0;v∈VG . The four local chromatic numbor of G is defined as c4 G=minc4 c=min &cubl0;max&cubl0;cG&vbm0; wherec isa4-local coloringofG&cubr0;&cubr0;. In this thesis, the four local chromatic number of some well known class of graphs will be determined.
Colorings; Four; Graphs; Local
University of Nevada, Las Vegas
If you are the rightful copyright holder of this dissertation or thesis and wish to have the full text removed from Digital Scholarship@UNLV, please submit a request to email@example.com and include clear identification of the work, preferably with URL.
Katseanes, James, "Four local colorings of graphs" (2007). UNLV Retrospective Theses & Dissertations. 2243.
IN COPYRIGHT. For more information about this rights statement, please visit http://rightsstatements.org/vocab/InC/1.0/