On the Chromatic Number of Some Harary Graphs
نویسندگان
چکیده
In this paper we answer a question posed [1]. We show that χ(H2m,3m+2) = m + k + 1 such that k = m/2 and H2m,3m+2 is the Harary graph. Mathematics Subject Classification: 05C15
منابع مشابه
Chromatic Numbers in Some Graphs
Let G = (V,E) be a graph. A k-coloring of a graph G is a labeling f : V (G) → T , where | T |= k and it is proper if the adjacent vertices have different labels. A graph is k-colorable if it has a proper k-coloring. The chromatic number χ(G) is the least k such that G is k-colorable. Here we study chromatic numbers in some kinds of Harary graphs. Mathematics Subject Classification: 05C15
متن کاملOn the Edge-Difference and Edge-Sum Chromatic Sum of the Simple Graphs
For a coloring $c$ of a graph $G$, the edge-difference coloring sum and edge-sum coloring sum with respect to the coloring $c$ are respectively $sum_c D(G)=sum |c(a)-c(b)|$ and $sum_s S(G)=sum (c(a)+c(b))$, where the summations are taken over all edges $abin E(G)$. The edge-difference chromatic sum, denoted by $sum D(G)$, and the edge-sum chromatic sum, denoted by $sum S(G)$, a...
متن کاملChromatic automorphisms and symmetries of some graphs
In this paper we will investigate the edge-chromatic automorphism groups for two classes of graphs. Chromatic automorphism groups have been studied by a number of people, including Chvatal [4] and Baumann et al. [l, 21. Characterizations will be given for these groups. Note that all arithmetic will be done modp, p not necessarily prime. The particular p will be clear from the context. These gra...
متن کاملOn the cost chromatic number of outerplanar, planar, and line graphs
We consider vertex colorings of graphs in which each color has an associated cost which is incurred each time the color is assigned to a vertex. The cost of the coloring is the sum of the costs incurred at each vertex. The cost chromatic number of a graph with respect to a cost set is the minimum number of colors necessary to produce a minimum cost coloring of the graph. We show that the cost c...
متن کاملThe locating-chromatic number for Halin graphs
Let G be a connected graph. Let f be a proper k -coloring of G and Π = (R_1, R_2, . . . , R_k) bean ordered partition of V (G) into color classes. For any vertex v of G, define the color code c_Π(v) of v with respect to Π to be a k -tuple (d(v, R_1), d(v, R_2), . . . , d(v, R_k)), where d(v, R_i) is the min{d(v, x)|x ∈ R_i}. If distinct vertices have distinct color codes, then we call f a locat...
متن کامل