The total dominator coloring of dense, octahedral and queen’s graphs

Author:

Lazuardi A R,Slamin ,Dafik ,Kurniawati E Y,Maylisa I N

Abstract

Abstract Let G be a graph, then the dominator coloring of G is a proper coloring, in which every vertex of G dominates every vertex of at least one color class. The Total dominator coloring of graph is a proper coloring with extra property that every vertex in the graph properly dominates an entire color class. The total dominator chromatic number X d t ( G ) of G is the minimum number of color classes in a total dominator coloring of it. In this paper, total dominator coloring of dense, octahedral and queen’s graphs have been disscussed.

Publisher

IOP Publishing

Subject

General Physics and Astronomy

Reference16 articles.

1. On local super antimagic face coloring of plane graphs;Anggraeni;IOP Conferrence series,2019

2. On some domination colorings of graphs;Guillaume;Journal Discrete Applied Mathematics,2017

3. On geodesic structures of weakly median graphs. Decomposition and octahedral graphs;March;Journal Discrete Mathematics,2006

4. Dominator and total dominator colorings in vague graphs;Lian;Engineering and Apllied Science Letters,2019

5. On antimagic labelings of disjoint union of complete s-partite graphs;Dafik;J. Combin Math. Combin. Comput,2008

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3