Results 41 to 50 of about 15,555,412 (284)
On the total chromatic number of the direct product of cycles and complete graphs
RAIRO Oper. Res.A \textit{$k$-total coloring} of a graph $G$ is an assignment of $k$ colors to the elements (vertices and edges) of $G$ so that adjacent or incident elements have different colors.
Diane Castonguay +5 more
semanticscholar +1 more source
Generalized Fractional and Circular Total Colorings of Graphs
Discussiones Mathematicae Graph Theory, 2015 Let P and Q be additive and hereditary graph properties, r, s ∈ N, r ≥ s, and [ℤr]s be the set of all s-element subsets of ℤr. An (r, s)-fractional (P,Q)-total coloring of G is an assignment h : V (G) ∪ E(G) → [ℤr]s such that for each i ∈ ℤr the ...
Kemnitz Arnfried +4 more
doaj +1 more source
On the AVD-total chromatic number of circulant graphs
Anais do IX Encontro de Teoria da Computação (ETC 2024)AVD-k-total coloring of a simple graph G is a mapping π : V (G) ∪ E(G) → {1, . . ., k} such that: adjacent or incident elements x, y ∈ V (G) ∪ E(G), π(x) ≠ π(y); and for each pair of adjacent vertices x, y ∈ V (G), sets {π(x)} ∪ {π(xv) | xv ∈ E(G) and v ∈
Matheus Adauto, Mauro Nigro
semanticscholar +1 more source
Two-floor buildings need eight colors
Journal of Graph Algorithms and Applications, 2015 Motivated by frequency assignment in office blocks, we study the chromatic number of the adjacency graph of a 3-dimensional parallelepiped arrangement.
Stéphane Bessy +2 more
doaj +1 more source
Advanced Engineering Materials, EarlyView.Residual adhesive after electrode loading in adhesive‐assisted resistance spot welding is quantified through a traceable experimental‐to‐digital workflow. Chromatic confocal topography provides calibrated surface‐height data, while OpenCV detects the electrode imprint and integrates adhesive height into comparable volume metrics.
Sung‐Min Wi, Jiangdong Zhao
wiley +1 more source
Introduction to total dominator edge chromatic number [PDF]
, 2022 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 class.
Ghanbari, Nima, Alikhani, Saeid
core
Super local edge anti-magic total coloring of paths and its derivation
Indonesian Journal of Combinatorics, 2020 Suppose G(V,E) be a connected simple graph and suppose u,v,x be vertices of graph G. A bijection f : V ∪ E → {1,2,3,...,|V (G)| + |E(G)|} is called super local edge antimagic total labeling if for any adjacent edges uv and vx, w(uv) 6= w(vx), which w(uv)
Fawwaz Fakhrurrozi Hadiputra +2 more
doaj +1 more source
On harmonious chromatic number of triple star graph [PDF]
Journal of Hyperstructures, 2016 A Harmonious coloring of a graph G is a proper vertex coloring of G, in which every pair of colors appears on at most one pair of adjacent vertices and the harmonious chromatic number of graph G is the minimum number of colors needed for the harmonious ...
Akhlak Mansuri
doaj +1 more source
On the AVD-Total Chromatic Number of 4-Regular Circulant Graphs
Proceeding Series of the Brazilian Society of Computational and Applied Mathematics. An AVD-k -total coloring of a simple graph G is a mapping π : V ( G ) ∪ E ( G ) → { 1 , . . . , k } , with k ≥ 1 such that: for each pair of adjacent or incident elements x, y ∈ V ( G ) ∪ E ( G ) , π ( x ) ̸ = π ( y ) ; and for each pair of adjacent ...
Luerbio Faria, Mauro Nigro, Diana Sasaki
semanticscholar +1 more source
Advanced Functional Materials, EarlyView.A new class of sulfur‐free, oxygen‐bridged dibenzofuran‐based polymers is developed for ultrahigh‐refractive‐index applications. The rigid π‐extended architecture and enhanced molecular polarizability enable exceptional optical performance, combining refractive indices up to 1.848 with high Abbe numbers and full visible transparency. This work offers a
Hend A. Hegazy +5 more
wiley +1 more source