MORE ON THE GLOBAL DOMINATOR CHROMATIC NUMBER

سال انتشار: 1404
نوع سند: مقاله کنفرانسی
زبان: انگلیسی
مشاهده: 13

نسخه کامل این مقاله ارائه نشده است و در دسترس نمی باشد

استخراج به نرم افزارهای پژوهشی:

لینک ثابت به این مقاله:

شناسه ملی سند علمی:

GTACCA01_038

تاریخ نمایه سازی: 19 مرداد 1404

چکیده مقاله:

For a graph G = (V,E) and a vertex subset DCV, a vertex v Є V is called a dominator of D if v is adjacent to every vertex in D, and an anti-dominator of D if v is not adjacent to any vertex in D. Given a coloring C = {V۱, V۲, ...Vk} of G, a color class V₁ is a dominating color class or an anti-dominating color class for a vertex v if v dominates all vertices in V¿ or none, respectively. A coloring C is a global dominator coloring if each vertex in G has both a dominating and an anti-dominating color class. The global dominator chromatic number, denoted by Xgd (G), is the minimum number of colors required for a global dominator coloring of G. In this paper, we obtain more results on Xgd (G).

نویسندگان

HADI NOURI SAMANI

Department of Mathematical Science, Yazd University, ۸۹۱۹۵-۷۴۱, Yazd, Iran

SAEID ALIKHANI

Department of Mathematical Science, Yazd University, ۸۹۱۹۵-۷۴۱, Yazd, Iran