相关论文: Total dominator chromatic number of $k$-subdivisio…

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. 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)$…

We introduce the total dominator edge chromatic number of a graph $G$. A total dominator edge coloring (briefly TDE-coloring) of $G$ is a proper edge coloring of $G$ in which each edge of the graph is adjacent to every edge of some color…

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…

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…

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 (TDC) number…

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…

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…

Let $G=(V,E)$ be a graph with no isolated vertices. A vertex $v$ totally dominate a vertex $w$ ($w \ne v$), if $v$ is adjacent to $w$. A set $D \subseteq V$ called a total dominating set of $G$ if every vertex $v\in V$ is totally dominated…

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…

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…

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…

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…

Domination and coloring are two classic problems in graph theory. The major focus of this paper is the CD-COLORING problem which combines the flavours of domination and colouring. Let $G$ be an undirected graph. A proper vertex coloring of…

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…

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…

A total $k$-coloring of a graph $G$ is a coloring of $V(G)\cup E(G)$ using $k$ colors such that no two adjacent or incident elements receive the same color. The total chromatic number $\chi"(G)$ of $G$ is the smallest integer $k$ such that…

For a graph $G = (V(G), E(G))$, a dominating set $D$ is a vertex subset of $V(G)$ in which every vertex of $V(G) \setminus D$ is adjacent to a vertex in $D$. The domination number of $G$ is the minimum cardinality of a dominating set of $G$…

Inspired by graceful labelings and total labelings of graphs, we introduce the idea of total difference labelings. A $k$-total labeling of a graph $G$ is an assignment of $k$ distinct labels to the edges and vertices of a graph so that…

Let $G=(V,E)$ be a connected, finite undirected graph. A set $S \subseteq V$ is said to be a total dominating set of $G$ if every vertex in $V$ is adjacent to some vertex in $S$. The total domination number, $\gamma_{t}(G)$, is the minimum…