کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
8903466 1632568 2017 8 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
b-Chromatic Sum of Mycielskian of Paths
موضوعات مرتبط
مهندسی و علوم پایه ریاضیات ریاضیات گسسته و ترکیبات
پیش نمایش صفحه اول مقاله
b-Chromatic Sum of Mycielskian of Paths
چکیده انگلیسی
A b-coloring of a graph G is a proper coloring of the vertices of G such that there exist a vertex in each color class joined to at least one vertex in each other color classes. The b-chromatic number of a graph G, denoted by ϕ(G), is the largest integer k such that G has a b-coloring with k colors. The b-chromatic sum of a graph G(V, E), denoted by ϕ′(G) is defined as the minimum of sum of colors c(v) of v for all v∈V in a b-coloring of G using ϕ(G) colors, where the colors are taken as the positive integer. In this paper, the b-chromatic sum of Mycielskian of a path is discussed.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Electronic Notes in Discrete Mathematics - Volume 63, December 2017, Pages 407-414
نویسندگان
, ,