Results 71 to 80 of about 117,877 (279)
Advanced Materials, EarlyView.We introduce a molecular strategy to assemble one‐dimensional (1D) materials into two‐dimensional (2D) van der Waals metal–organic frameworks (MOFs). Crystals of [FeX(pzX)(bpy)] (X = Cl, F) form anisotropic 2D layers that can be mechanically exfoliated into thin sheets.
Eleni C. Mazarakioti +12 more
wiley +1 more source
Chromatic and clique numbers of a class of perfect graphs [PDF]
Transactions on Combinatorics, 2015 Let p be a prime number and n be a positive integer. The graph G p (n) is a graph with vertex set [n]=1,2,ldots,n , in which there is an arc from u to v if and only if uneqv and pnmidu+v . In this paper it is shown that G p (n) is a perfect
Mohammad Reza Fander
doaj
T-Colorings, Divisibility and the Circular Chromatic Number
Discussiones Mathematicae Graph Theory, 2021 Let T be a T -set, i.e., a finite set of nonnegative integers satisfying 0 ∈ T, and G be a graph. In the paper we study relations between the T -edge spans espT (G) and espd⊙T(G), where d is a positive integer and d⊙T={0≤t≤d(maxT+1):d|t⇒t/d∈T}.d \odot T =
Janczewski Robert +2 more
doaj +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
Global Dominator Chromatic Number of Certain Graphs [PDF]
Mathematics Interdisciplinary ResearchFor a graph G=(V,E) and a vertex subset $D\subseteq V$, a vertex $v\in V$ is called a dominator of D if v is adjacent to every vertex in D, and an anti-dominator of D if v is not adjacent to any vertex in D. Given a coloring $C=\{V_{1},V_{2},\ldots,
Hadi Nouri Samani +2 more
doaj +1 more source
Structural Color Inkjet Printing With Mie‐Resonant Silicon Nanoparticles
Advanced Materials, EarlyView.Water‐based inks incorporating Mie‐resonant silicon nanoparticles were developed, and their application to structural color inkjet printing was demonstrated. By controlling the nanoparticle size and concentration, coloration covering a wide color gamut was achieved.
Hiroto Yamana +3 more
wiley +1 more source
Grid Representations and the Chromatic Number [PDF]
, 2012 A grid drawing of a graph maps vertices to grid points and edges to line segments that avoid grid points representing other vertices. We show that there is a number of grid points that some line segment of an arbitrary grid drawing must intersect.
Balko, Martin
core +1 more source
White‐Light Emission in Zeolitic Imidazolate Framework Glasses
Advanced Materials, EarlyView.Broadband blue emission is discovered in ZIF‐62 through vitrification and hot‐pressing. This emission is significantly enhanced and redshifted when the ZIF‐62 glass is annealed above the critical temperature (1.07Tg), being attributed to an enhancement of ligand‐to‐ligand charge transfer.
Zhencai Li +19 more
wiley +1 more source
The locating-chromatic number for Halin graphs
Communications in Combinatorics and Optimization, 2017 Let $G$ be a connected graph. Let $f$ be a proper $k$-coloring of $G$ and $\Pi=\{R_1,R_2,\ldots, R_k\}$ be an ordered partition of $V(G)$ into color classes. For any vertex $v$ of $G,$ define the {\em color code} $c_\Pi(v)$ of $v$ with respect to $\
I.A. Purwasih +4 more
doaj +1 more source
Chromatic number of Euclidean plane
, 2015 If the chromatic number of Euclidean plane is larger than four, but it is known that the chromatic number of planar graphs is equal to four, then how does one explain it? In my opinion, they are contradictory to each other. This idea leads to confirm the
Wang, Kai-Rui
core