MATEC Web Conf.
Volume 355, 20222021 International Conference on Physics, Computing and Mathematical (ICPCM2021)
|Number of page(s)||8|
|Section||Mathematical Science and Application|
|Published online||12 January 2022|
The majority coloring of the join and Cartesian product of some digraph
School of Mathematical Sciences, University of Jinan, Jinan, China, 250022
* Corresponding author: email@example.com
A majority coloring of a digraph is a vertex coloring such that for every vertex, the number of vertices with the same color in the out-neighborhood does not exceed half of its out-degree. Kreutzer, Oum, Seymour and van der Zyper proved that every digraph is majority 4-colorable and conjecture that every digraph has a majority 3-coloring. This paper mainly studies the majority coloring of the joint and Cartesian product of some special digraphs and proved the conjecture is true for the join graph and the Cartesian product. According to the influence of the number of vertices in digraph, we prove the majority coloring of the joint and Cartesian product of some digraph.
© The Authors, published by EDP Sciences, 2022
This is an Open Access article distributed under the terms of the Creative Commons Attribution License 4.0, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.