相关论文: Dominator Colorings of Digraphs

Given a graph $G$, the total dominator coloring problem seeks a proper coloring of $G$ with the additional property that every vertex in the graph is adjacent to all vertices of a color class. We seek to minimize the number of color…

Let $G$ be a simple graph of order $n$. A majority dominator coloring of a graph $G$ is proper coloring in which each vertex of the graph dominates at least half of one color class. The majority dominator chromatic number $\chi_{md}(G)$ is…

The total dominator total coloring of a graph is a total coloring of the graph such that each object of the graph is adjacent or incident to every object of some color class. The minimum namber of the color classes of a total dominator…

A total dominator coloring of a graph $G$ is a proper coloring of $G$ in which each vertex of the graph is adjacent to every vertex of some color class. The total dominator chromatic number of a graph is the minimum number of color classes…

A total dominator coloring of a graph G is a proper coloring of G in which each vertex of the graph is adjacent to every vertex of some color class. The total dominator chromatic number of a graph is the minimum number of color classes in a…

Dominator coloring of a graph is a proper (vertex) coloring with the property that every vertex is either alone in its color class or adjacent to all vertices of at least one color class. A dominated coloring of a graph is a proper coloring…

A domination coloring of a graph $G$ is a proper vertex coloring of $G$ such that each vertex of $G$ dominates at least one color class, and each color class is dominated by at least one vertex. The minimum number of colors among all…

Total dominator total coloring of a graph is a total coloring of the graph such that each object of the graph is adjacent or incident to every object of some color class. The minimum namber of the color classes of a total dominator total…

Let $G$ be a simple graph. A total dominator coloring of $G$ is a proper coloring of the vertices of $G$ in which each vertex of the graph is adjacent to every vertex of some color class. The total dominator chromatic number $\chi_d^t(G)$…

Let $G$ be a simple graph. The dominated coloring of $G$ is a proper coloring of $G$ such that each color class is dominated by at least one vertex. The minimum number of colors needed for a dominated coloring of $G$ is called the dominated…

This paper introduces a new variant of domination-related coloring of graphs, which is a combination of their dominator coloring and equitable coloring called the equitable dominator coloring. An equitable coloring is a proper coloring in…

This paper introduces the concept of domination in the context of colored graphs (where each color assigns a weight to the vertices of its class), termed up-color domination, where a vertex dominating another must be heavier than the other.…

We introduce and study the dominated edge coloring of a graph. A dominated edge coloring of a graph $G$ is a proper edge coloring of $G$ such that each color class is dominated by at least one edge of $G$. The minimum number of colors among…

We say that a graph $H$ dominates another graph $H'$ if the number of homomorphisms from $H'$ to any graph $G$ is dominated, in an appropriate sense, by the number of homomorphisms from $H$ to $G$. We study the family of dominating graphs,…

In this paper we initialize the study of independent domination in directed graphs. We show that an independent dominating set of an orientation of a graph is also an independent dominating set of the underlying graph, but that the converse…

We define a $P$-compelling coloring as a proper coloring of the vertices of a graph such that every subset consisting of one vertex of each color has property $P$. The $P$-compelling chromatic number is the minimum number of colors in such…

Let $G$ be a simple graph. The dominated coloring of a graph $G$ is a proper coloring of $G$ such that each color class is dominated by at least one vertex. The minimum number of colors needed for a dominated coloring of $G$ is called the…

\qquad A \emph{coloring} of a digraph $D=(V,E)$ is a coloring of its vertices following the rule: Let $uv$ be an arc in $D$. If the tail $u$ is colored first, then the head $v$ should receive a color different from that of $u$. The…

We consider some problems concerning the maximum number of (strong) dominating sets in a regular graph, and their weighted analogues. Our primary tool is Shearer's entropy lemma. These techniques extend to a reasonably broad class of graph…

A total dominator coloring of a graph $G$ is a proper coloring of $G$ in which each vertex of the graph is adjacent to every vertex of some color class. The total dominator chromatic number $\chi_d^t(G)$ of $G$ is the minimum number of…