Hamiltonian chromatic number of block graphs
نویسندگان
چکیده
منابع مشابه
Hamiltonian chromatic number of block graphs
Let G be a simple connected graph of order n. A hamiltonian coloring c of a graph G is an assignment of colors (non-negative integers) to the vertices of G such that D(u, v) + |c(u) − c(v)| ≥ n − 1 for every two distinct vertices u and v of G, where D(u, v) denotes the detour distance between u and v in G which is the length of the longest path between u and v. The value hc(c) of a hamiltonian ...
متن کامل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...
متن کاملThe locating chromatic number of the join of graphs
Let $f$ be a proper $k$-coloring of a connected graph $G$ and $Pi=(V_1,V_2,ldots,V_k)$ be an ordered partition of $V(G)$ into the resulting color classes. For a vertex $v$ of $G$, the color code of $v$ with respect to $Pi$ is defined to be the ordered $k$-tuple $c_{{}_Pi}(v)=(d(v,V_1),d(v,V_2),ldots,d(v,V_k))$, where $d(v,V_i)=min{d(v,x):~xin V_i}, 1leq ileq k$. If distinct...
متن کاملGame chromatic number of graphs
y Abstract We show that if a graph has acyclic chromatic number k, then its game chromatic number is at most k(k + 1). By applying the known upper bounds for the acyclic chromatic numbers of various classes of graphs, we obtain upper bounds for the game chromatic number of these classes of graphs. In particular, since a planar graph has acyclic chromatic number at most 5, we conclude that the g...
متن کاملChromatic number of fuzzy graphs
Abstract. Coloring of fuzzy graphs plays a vital role in theory and practical applications. The concept of chromatic number of fuzzy graphs was introduced by Munoz[6] et.al. Later Eslahchi and Onagh [7]defined fuzzy coloring of fuzzy graphs and defined fuzzy chromatic number χ (G). Incorporating the features of these two definitions, the definition of chromatic number of a fuzzy graph χ(G), is ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Graph Algorithms and Applications
سال: 2017
ISSN: 1526-1719
DOI: 10.7155/jgaa.00420