Results 81 to 90 of about 27,939 (295)
Bounds on the Distinguishing Chromatic Number [PDF]
The Electronic Journal of Combinatorics, 2009 Collins and Trenk define the distinguishing chromatic number $\chi_D(G)$ of a graph $G$ to be the minimum number of colors needed to properly color the vertices of $G$ so that the only automorphism of $G$ that preserves colors is the identity. They prove results about $\chi_D(G)$ based on the underlying graph $G$.
Karen L. Collins +2 more
openaire +2 more sources
Aerosol Jet Printed Polymer‐Free High Aspect Ratio Quantum Dot Films for Enhanced Color Conversion
Advanced Optical Materials, EarlyView.Polymer‐free quantum dot color conversion layers are aerosol jet printed at high aspect ratio by tuning the aerosol focus ratio to induce in‐flight droplet drying. Contact‐line pinning suppresses lateral spreading, enabling ∼10 µm‐thick films at ∼50 µm widths with blue light leakage below 0.25% and conversion efficiency approaching 18%, demonstrated ...
Sukyung Choi +5 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
Circular chromatic number a survey
, 2001 The circular chromatic number χc(G) of a graph G (also known as ‘the star-chromatic number’), is a natural generalization of the chromatic number of a graph.
Xuding Zhu, Zhu, Xuding
core +1 more source
The $b$-Chromatic Number and $f$-Chromatic Vertex Number of Regular Graphs
Discret. Appl. Math., 2013 The $b$-chromatic number of a graph $G$, denoted by $b(G)$, is the largest positive integer $k$ such that there exists a proper coloring for G with $k$ colors in which every color class contains at least one vertex adjacent to some vertex in each of the other color classes, such a vertex is called a dominant vertex. The $f$-chromatic vertex number of a
El-Sahili, Amine +3 more
openaire +4 more sources
Advanced Optical Materials, EarlyView.Four donor–acceptor boron difluoride complexes based on triphenylamine donor and a naphthyridine acceptor units were synthesized, studied, and applied as OLED emitters. They exhibit pronounced intramolecular charge transfer character, balanced charge transport properties, and tunable emission. Near‐unity PLQYs are achieved for selected compounds, while
Omar Lahna +8 more
wiley +1 more source
TacScope: A Miniaturized Vision‐Based Tactile Sensor for Surgical Applications
Advanced Robotics Research, EarlyView.TacScope is a compact, vision‐based tactile sensor designed for robot‐assisted surgery. By leveraging a curved elastomer surface with pressure‐sensitive particle redistribution, it captures high‐resolution 3D tactile feedback. TacScope enables accurate tumor detection and shape classification beneath soft tissue phantoms, offering a scalable, low‐cost ...
Md Rakibul Islam Prince +3 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
ERK‐Mediated Phosphorylation of YAP Defines a Noncanonical FGF Signaling Mechanism in Stem Cells
Advanced Science, EarlyView.With a powerful combination of in vivo, ex vivo, and in vitro models, the authors highlight a novel FGF‐ERK signaling regulation of YAP at the S128 site in neural crest‐derived stem cells. This study opens exciting new directions in stem cell biology and craniofacial biology, paving the way for potential innovations in the treatment of craniofacial ...
Xiaolei Zhao +16 more
wiley +1 more source
The Incidence Chromatic Number of Toroidal Grids
Discussiones Mathematicae Graph Theory, 2013 An incidence in a graph G is a pair (v, e) with v ∈ V (G) and e ∈ E(G), such that v and e are incident. Two incidences (v, e) and (w, f) are adjacent if v = w, or e = f, or the edge vw equals e or f.
Sopena Éric, Wu Jiaojiao
doaj +1 more source