Results 41 to 50 of about 1,402,601 (292)
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
Multilayer Self‐Limiting Electrospray Deposition via Stepped Voltage Bias
Advanced Engineering Materials, EarlyView.Self‐limiting electrospray deposition (SLED) uses a high voltage to generate and deposit a charged payload on a target surface. The coating retains its charge, repelling newly arriving material. SLED thickness can be decreased by applying a secondary bias to the target.
Madhuri Deb +3 more
wiley +1 more source
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
The AVD-total chromatic number of fullerene molecular graphs
Discrete Mathematics & Theoretical Computer ScienceFinal version updated according to the journal (DMTCS) requirements, including corrected affiliations and layout adjustments. An \textit{AVD-$k$-total coloring} of a simple graph $G$ is a mapping $\pi:V(G) \cup E(G) \to \{1,\ldots,k\}$, with $k \geq 1 ...
M. D. Cruz +3 more
semanticscholar +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
AKCE International Journal of Graphs and Combinatorics, 2023 The smallest integer k needed for the assignment of k colors to the elements so that the coloring is proper (vertices and edges) is called the total chromatic number of a graph.
Jayabalan Geetha +2 more
doaj +1 more source
Total chromatic number of graphs with small genus
Electronic Notes in Discrete Mathematics, 2002 Abstract Given a graph G, a total k-coloring of G is a simultaneous coloring of the vertices and edges of G with k colors. Denote χve (G) the total chromatic number of G, and c(Σ) the Euler characteristic of a surfase Σ. In this paper, we prove that for any simple graph G which can be embedded in a surface Σ with Euler characteristic c(Σ), χve (G ...
Rong Luo, Cun-Quan Zhang
openaire +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