Results 71 to 80 of about 1,402,601 (292)
A characterization for the neighbor-distinguishing total chromatic number of planar graphs with Δ=13
Discrete Mathematics, 2018 The neighbor-distinguishing total chromatic number χ a ′ ′ ( G ) of a graph G is the smallest integer k such that G can be totally colored using k colors with a condition that any two adjacent vertices have different sets of colors.
Jingjing Huo, Weifan Wang, Yiqiao Wang
semanticscholar +1 more source
Transparent Perovskite Light‐Emitting Diodes with Conductive Oxide Top Electrodes
Advanced Materials, EarlyView.Transparent perovskite light‐emitting diodes (TrPeLEDs) enable simultaneous display and transparency, expanding application possibilities. Using a metal oxide buffer layer and pulsed laser deposition, TrPeLEDs with diverse compositions and architectures are demonstrated.
Michele Forzatti +11 more
wiley +1 more source
Note on vertex and total proper connection numbers
AKCE International Journal of Graphs and Combinatorics, 2016 This note introduces the vertex proper connection number of a graph and provides a relationship to the chromatic number of minimally connected subgraphs.
Emily Chizmar +2 more
doaj +1 more source
The List Edge Coloring and List Total Coloring of Planar Graphs with Maximum Degree at Least 7
Discussiones Mathematicae Graph Theory, 2020 A graph G is edge k-choosable (respectively, total k-choosable) if, whenever we are given a list L(x) of colors with |L(x)| = k for each x ∈ E(G) (x ∈ E(G) ∪ V (G)), we can choose a color from L(x) for each element x such that no two adjacent (or ...
Sun Lin +3 more
doaj +1 more source
A study of the total chromatic number of equibipartite graphs
Discrete Mathematics, 1998 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Bor-Liang Chen +3 more
openaire +2 more sources
Total Chromatic Number of Middle and Total Graph of Path and Sunlet Graph
, 2018 In this paper, we have considered the finite, simple and undirected graphs. Let ( ( ), ( )) G V G E G be a graph with the vertex set ( ) V G and the edge set ( ) E G respectively.
D. Muthuramakrishnan, G. Jayaraman
semanticscholar +1 more source
Ratiometric Mycotoxin Detection in Living Plants With Dual‐Emissive Nanosensors
Advanced Materials, EarlyView.A minimally invasive microneedle patch integrates carbon dot‐embedded metal–organic frameworks as nanosensors to detect a key fungal toxin in living plants. The nanosensor produces a ratiometric fluorescence signal that enables early, non‐destructive diagnosis of fungal infection before visible symptoms, offering a new biomaterials‐based strategy for ...
Yuliang Li +9 more
wiley +1 more source
Total chromatic number of unichord-free graphs
Discrete Applied Mathematics, 2011 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Raphael C. S. Machado +1 more
openaire +1 more source
Advanced Materials Technologies, EarlyView.ABSTRACT Real‐time insight into local chemistry is critical for reliable part quality in additive manufacturing, especially laser powder bed fusion (PBF‑LB/M), where rapid thermal cycles and localized evaporation can undermine part performance. Optical emission spectroscopy (OES) offers non‑intrusive, in situ plume monitoring, but detection geometry ...
Philipp Gabriel +4 more
wiley +1 more source
Total dominator chromatic number of some operations on a graph
Bulletin of Computational Applied Mathematics, 2018 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.
Nima Ghanbari, Saeid Alikhani
doaj