Figure 2
(a) The total domination coloring of µ(C3); (b) The total domination coloring of µ(C4) ã 2. (a) µ(C3)››XÚ;(b) µ(C4)››XÚ
Source publication
Similar publications
The water resource is severely compromised by climate change, and its availability and quality can no longer be taken for granted, even in places considered pristine, such as mountains. In this study, we evaluated the water colour variability of three artificial mountain lakes located in a relatively small basin (Western Italian Alps) at high eleva...
Graphs considered in this paper are finite, undirected and without loops, but with multiple edges. For an integer \(t\ge 1\), denote by \(\mathcal{MG}_t\) the class of graphs whose maximum multiplicity is at most t. A graph G is called strictly t-degenerate if every non-empty subgraph H of G contains a vertex v whose degree in H is at most \(t-1\)....
Solving a long standing conjecture of Erd\H{o}s and Simonovits, Brandt and Thomass\'e proved that the chromatic number of each triangle-free graph $G$ such that $\delta(G)>|V(G)|/3$ is at most four. In fact, they showed the much stronger result that every maximal triangle-free graph $G$ satisfying this minimum degree condition is a blow-up of eithe...
Let $ f: V(G)\cup E(G)\rightarrow \{1, 2, \dots, k\} $ be a total $ k $ -coloring of $ G $. Define a weight function on total coloring as
\begin{document} $ \phi(x) = f(x)+\sum\limits_{e\ni x}f(e)+\sum\limits_{y\in N(x)}f(y), $ \end{document}
where $ N(x) = \{y\in V(G)|xy\in E(G)\} $. If $ \phi(x)\neq \phi(y) $ for any edge $ xy\in E(G) $, then $ f...
In this article, the new concept proper colourings in r - regular Modified Zagreb index graph has been introduced. The first and second Modified Zagreb indices are introduced. In this article, new inequalities on chromatic number related with first and second Modified Zagreb indices are being established.
