Results 91 to 100 of about 2,302 (247)
This study presents a novel quantum dot electrophoretic display (QDEPD), which combines electro‐controlled reflection and optically‐triggered emission to achieve efficient multi‐modal switching within a single pixel. By incorporating multi‐component nanostructures, the system enhances functional integration and multi‐modal response capabilities.
Xingke Zheng +8 more
wiley +1 more source
A carbon‐quantum‐dots (CQDs)‐based programmable luminescent platform is proposed for multidimensional optical information encryption and high‐capacity data storage by leveraging wavelength‐division multiplexing. Furthermore, a prototype tri‐layer optical disk is demonstrated, where data written via laser ablation on different CQD layers are retrieved ...
Honglei Sun +9 more
wiley +1 more source
Distinguishing chromatic number of middle and subdivision graphs
8 pages, 4 ...
Banerjee, Amitayu +2 more
openaire +2 more sources
An orthogonal spirobifluorene‐fusion strategy is introduced for B/N/O‐alternated MR frameworks, enabling improved kRISC (5.46 × 103 s−1), high ΦPL (97%), and narrow‐band pure‐red emission. Vacuum‐evaporated OLEDs incorporating this emitter achieve an EQEmax >40% (FWHM = 36 nm) and exhibit exceptionally low efficiency roll‐off at high luminance ...
Yan‐Yun Jing +7 more
wiley +1 more source
Lead‐free halide perovskites for efficient light‐emitting devices
Overview of Lead‐free metal halide perovskites with different categories and optoelectronic application directions, including solid‐state lighting, light‐emitting diodes, piezoluminescence, flexible electronics, scintillators and CPL emitters. Abstract Lead halide perovskites exhibit promising optoelectronic properties for optoelectronic applications ...
Yueqi Shen +9 more
wiley +1 more source
Distinguishing numbers and distinguishing indices of oriented graphs [PDF]
A distinguishing r-vertex-labelling (resp. r-edge-labelling) of an undirected graph G is a mapping λ from the set of vertices (resp. the set of edges) of G to the set of labels {1,. ..
Sopena, Eric, Meslem, Kahina
core +1 more source
Neighbouringhood distinguishing colourings of graphs [PDF]
A thesis submitted in partial fulfilment of the requirements for the degree of Master of Science (Mathematics)In this mini thesis, we study neighbourhood distinguishing colouring (NDC) of graphs, which are proper colourings of the vertices with the added
Nafuka, Helena N
core
Eye Darkening Under Dehydration Stress in the Neotropical Frog Boana punctata (Schneider, 1799)
Dehydration induces a strong and partially reversible increase in iris pigmentation in the Neotropical frog Boana punctata. The tight relationship between iris darkening and hydration state identifies ocular pigmentation as a simple, non‐invasive physiological biomarker with broad potential for assessing hydric stress in amphibian populations ...
Ricardo Reques +5 more
wiley +1 more source
Linear Versus Centred Colouring via Pseudogrids
ABSTRACT A centred colouring of a graph is a vertex colouring in which every connected subgraph contains a vertex whose colour is unique and a linear colouring is a vertex colouring in which every (not‐necessarily induced) path contains a vertex whose colour is unique. For a graph G $G$, the centred chromatic number χ cen ( G ) ${\chi }_{\text{cen}}(G)$
Prosenjit Bose +4 more
wiley +1 more source
Δ+300 is a bound on the adjacent vertex distinguishing edge chromatic number [PDF]
An adjacent vertex distinguishing edge-coloring or an avd-coloring of a simple graph G is a proper edge-coloring of G such that no pair of adjacent vertices meets the same set of colors.
Hatami, Hamed
core +1 more source

