Results 61 to 70 of about 9,006,025 (294)
Advanced Functional Materials, EarlyView.Chiral dopants induce supramolecular chirality in an achiral polymer (PFO), generating spin‐polarized carriers via the chiral‐induced spin selectivity (CISS) and suggesting a possible contribution of Spin‐polarized carrier transport to circularly polarized electroluminescence (CPEL).
Kazuyuki Asahi +4 more
wiley +1 more source
The Locating Chromatic Number of Book Graph
Journal of Mathematics, 2021 Let G=VG,EG be a connected graph and c:VG⟶1,2,…,k be a proper k-coloring of G. Let Π be a partition of vertices of G induced by the coloring c. We define the color code cΠv of a vertex v∈VG as an ordered k-tuple that contains the distance between each ...
Nur Inayah +2 more
doaj +1 more source
Note on $k$-chromatic graphs [PDF]
, 1994 summary:In this paper we characterize $k$-chromatic graphs without isolated vertices and connected $k$-chromatic graphs having a minimal number of ...
Marcu, Dănuţ
core +1 more source
The Chromatic Number of a Signed Graph [PDF]
The Electronic Journal of Combinatorics, 2016 In 1982, Zaslavsky introduced the concept of a proper vertex colouring of a signed graph $G$ as a mapping $\phi\colon V(G)\to \mathbb{Z}$ such that for any two adjacent vertices $u$ and $v$ the colour $\phi(u)$ is different from the colour $\sigma(uv)\phi(v)$, where is $\sigma(uv)$ is the sign of the edge $uv$.
Edita Mácajová +2 more
openaire +3 more sources
Advanced Functional Materials, EarlyView.Mask‐encoded UV exposure translates digital color information into pixel‐resolved structural‐color patterns in hydroxypropyl cellulose gels. Gaussian‐process‐guided calibration links UV processing conditions, wavelength, and mask opacity, enabling parallel fabrication of multicolor images in a single 10 s exposure.
Mengting Ye +8 more
wiley +1 more source
On the total chromatic edge stability number and the total chromatic subdivision number of graphs [PDF]
Discrete Mathematics Letters, 2022 Arnfried Kemnitz, Massimiliano Marangio
doaj +1 more source
ON LOCAL ANTIMAGIC CHROMATIC NUMBER OF GRAPHS [PDF]
Journal of Algebraic Systems, 2020 A {it local antimagic labeling} of a connected graph $G$ with at least three vertices, is a bijection $f:E(G) rightarrow {1,2,ldots , |E(G)|}$ such that for any two adjacent vertices $u$ and $v$ of $G$, the condition $omega _{f}(u) neq omega _{f}(v ...
S. Shaebani
doaj +1 more source
Chromatic numbers of spheres [PDF]
Discrete Mathematics, 2018 The chromatic number of a subset of Euclidean space is the minimal number of colors sufficient for coloring all points of this subset in such a way that any two points at the distance 1 have different colors. We give new upper bounds for chromatic numbers of spheres.
openaire +3 more sources
Advanced Functional Materials, EarlyView.Functional elastomer overlayers are integrated onto stretchable ZnS:Cu‐PDMS mechanoluminescent films to regulate light after emission without modifying the emissive composite. NLC‐PU provides haze‐assisted light extraction to enhance green mechanoluminescence, while DCM‐NLC‐PU combines green‐to‐yellow‐orange color conversion with enhanced outward light
Gyudam Jeon +3 more
wiley +1 more source
Chromatic roots are dense in the whole complex plane [PDF]
, 2004 I show that the zeros of the chromatic polynomials P-G(q) for the generalized theta graphs Theta((s.p)) are taken together, dense in the whole complex plane with the possible exception of the disc \q - l\ < l.
Sokal, AD
core