Results 81 to 90 of about 9,612,020 (345)
Proteins, Processing, and Properties of Adhesive Fluid Condensates Purified from Mussels
Mussels exhibit an unmatched proficiency for adhering to wet surfaces in salty environments—a remarkable ability that could inspire new biomedical and technical glues. The fluid protein condensates used to form the underwater mussel glue are extracted, reconstituted and characterized with advanced spectroscopy and nanomechanical analysis, revealing ...
Mathieu D. Rivard +8 more
wiley +1 more source
$2\times n$ Grids have Unbounded Anagram-Free Chromatic Number [PDF]
Saman Bazarghani +3 more
openalex +1 more source
Dual‐Ligand Metal‐Organic Frameworks via In Situ Amidoxime Engineering for Selective Ion Separation
Inspired by microbial ion‐trapping mechanisms, a mild and universal strategy is developed to construct highly porous amidoxime‐functionalized MOFs. DFT calculations and molecular force measurements reveal that the dual‐ligand amidoxime configuration significantly strengthens Ga(III) affinity.
Zhifang Lv +9 more
wiley +1 more source
Coloring Some Finite Sets in ℝn
This note relates to bounds on the chromatic number χ(ℝn) of the Euclidean space, which is the minimum number of colors needed to color all the points in ℝn so that any two points at the distance 1 receive different colors. In [6] a sequence of graphs Gn
Balogh József +2 more
doaj +1 more source
Cephalopod‐inspired photonic microparticles with dynamic structural coloration are fabricated via confined self‐assembly of linear block copolymers into ellipsoids containing stacked lamellae. Embedded superparamagnetic nanoparticles enable rapid magnetic alignment, restoring vivid, angle‐dependent color.
Gianluca Mazzotta +8 more
wiley +1 more source
Chromatic and clique numbers of a class of perfect graphs [PDF]
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
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
Triblock Polymer Engineering Enables Hydration‐Rich, High‐Performance, Fouling‐Resistant Interfaces
A molecularly engineered triblock polymer (PHZ) rapidly reorganizes into a hydration‐rich interfacial layer on diverse surfaces, strongly suppressing hydrophobic attraction and fouling. The triblock polymer provides robust energy and steric barriers to oily foulants, enabling high‐performance antifouling at ultralow dosage.
Chenyu Qiao +6 more
wiley +1 more source
Global Dominator Chromatic Number of Certain Graphs [PDF]
For 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
Chromatic Number of Pseudo-Von neuman Regular Graph
Let R be a commutative ring , the pseudo – von neuman regular graph of the ring R is define as a graph whose vertex set consists of all elements of R and any two distinct vertices a and b are adjacent if and only if , this graph denoted by
Nabeel E. Arif, Nermen J. Khalel
doaj +1 more source

