Results 21 to 30 of about 15,555,412 (284)
Total Global Dominator Coloring of Trees and Unicyclic Graphs
مجلة بغداد للعلوم, 2023 A total global dominator coloring of a graph is a proper vertex coloring of with respect to which every vertex in dominates a color class, not containing and does not dominate another color class.
Chithra K. P., Joseph Mayamma
doaj +1 more source
The fractional chromatic number of triangle-free subcubic graphs [PDF]
, 2014 Heckman and Thomas conjectured that the fractional chromatic number of any triangle-free subcubic graph is at most 14 / 5. Improving on estimates of Hatami and Zhu and of Lu and Peng, we prove that the fractional chromatic number of any triangle-free ...
Král’, Daniel +5 more
core +1 more source
On Adjacent Vertex-distinguishing Equitable-total Chromatic Number of Pm ∨ Fm
, 2021 Suppose the simple graph G(V, E) is at least 2nd-order connected. We study the adjacent vertex-distinguishing equitable-total coloring of the join graph Pm ∨ Fm which belongs to the graph G(V, E). By constructing the total coloring of Pm ∨ Fm , we obtain
Ji-Shun Wang +3 more
semanticscholar +1 more source
The harmonious chromatic number of almost all trees [PDF]
, 1995 A harmonious colouring of a simple graph G is a proper vertex colouring such that each pair of colours appears together on at most one edge. The harmonious chromatic number h(G) is the least number of colours in such a colouring.For any positive integer ...
Edwards, Keith
core +1 more source
A sharp upper bound for the harmonious total chromatic number of graphs and multigraphs [PDF]
The Art of Discrete and Applied MathematicsA proper total colouring of a graph $G$ is called harmonious if it has the further property that when replacing each unordered pair of incident vertices and edges with their colours, then no pair of colours appears twice.
M. Abreu +6 more
semanticscholar +1 more source
A Bound on the Total Chromatic Number [PDF]
, 1998 published source acknowledged. The original publication is available http://www.springerlink.com/content/?k=a+bound+on+the+total+chromatic+numberWe prove that the total chromatic number of any graph with maximum degree Δ is at most Δ plus an absolute ...
Reed, B., Molloy, M.
core +2 more sources
Frontiers in Materials, 2022 Chromatic aberration is one of the quality defects in the appearance of fair-faced concrete (FFC). The mainly surface chromatic aberration identification (CAI) method being applied is manual observation, which is subjective and time-consuming.
Gang Yao +7 more
doaj +1 more source
Total Colouring of New Classes of Subcubic graphs
Theory and Applications of Graphs, 2022 The total chromatic number of a graph $G$, denoted $\chi^{\prime\prime}(G)$, is the least number of colours needed to colour the vertices and the edges of $G$ such that no incident or adjacent elements (vertices or edges) receive the same colour.
Sethuraman G, Velankanni Anthonymuthu
doaj +1 more source
Total dominator chromatic number of k-subdivision of graphs [PDF]
, 2023 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.
Soltani, Samaneh +2 more
core +1 more source
Complete characterization of graphs with local total antimagic chromatic number 3 [PDF]
Opuscula MathematicaA total labeling of a graph \(G = (V, E)\) is said to be local total antimagic if it is a bijection \(f: V\cup E \to\{1,\ldots,|V|+|E|\}\) such that adjacent vertices, adjacent edges, and pairs of an incident vertex and edge have distinct induced weights
Gee-Choon Lau
doaj +1 more source