Results 51 to 60 of about 8,753,370 (220)

Sticker Valence Governs Chain Collapse and Liquid‐Liquid Phase Separation in Peptide‐Inspired Associative Polymers

open access: yesAdvanced Science, EarlyView.
Peptide‐inspired associative polymers with arginine‐like guanidinium stickers and lysine‐like ammonium spacers undergo chain collapse and liquid‐liquid phase separation induced by reversible sticker associations. Sticker valence and tunable association strength jointly control the phase behavior, chain conformation, and interfacial cohesion of these ...
Seung‐Hwan Oh   +7 more
wiley   +1 more source

On the Packing Chromatic Number on Hamming Graphs and General Graphs

open access: yesCoRR, 2015
The packing chromatic number $χ_ρ(G)$ of a graph $G$ is the smallest integer $k$ needed to proper color the vertices of $G$ in such a way the distance between any two vertices having color $i$ be at least $i+1$. We obtain $χ_ρ(H_{q,m})$ for $m=3$, where $H_{q,m}$ is the Hamming graph of words of length $m$ and alphabet with $q$ symbols, and tabulate ...
Graciela L. Nasini   +2 more
openaire   +3 more sources

Aggregation‐Controlled Triplet Exciton Regulation Enables Single‐Emitter Color‐Evolving Afterglow

open access: yesAdvanced Science, EarlyView.
A single‐emitter system based on DTP‐R luminophores enables time‐evolving afterglow through aggregation‐regulated excited‐state dynamics. The coexistence and suppression of delayed fluorescence and phosphorescence are controlled via concentration tuning and host‐guest engineering, revealing the RISC origin of delayed fluorescence and enabling ...
Yu Zhang   +14 more
wiley   +1 more source

Decoupling Fabrication From Encoding: DNA‐Addressable Template Microparticles for Large, User‐Defined Optical Barcode Libraries

open access: yesAdvanced Science, EarlyView.
A universal hydrogel microparticle template with five DNA‐addressable domains decouples particle fabrication from barcode writing. Contact‐free multilaminar flow lithography produces >106 templates/h, and post‐fabrication domain‐selective hybridization converts one batch into large, user‐defined optical barcode libraries with robust decoding and re ...
Akihiro Eguchi   +5 more
wiley   +1 more source

Increased Disarray of Extracellular Matrix Collagen‐I Fiber Network and Compromised Biomechanics in Aortae From Marfan‐Syndrome Mice Assessed Through Combined Opto‐Biomechatronics

open access: yesAdvanced Science, EarlyView.
Combined structure‐function assessment in aortic rings from Marfan mice using MechaMorph Opto‐Biomechatronics technology relates increased elasticity (stiffness) and dynamic viscosity and less ordered extracellular matrix 3D‐structure (collagen) as potential causes for impaired Windkessel function and compromised haemodynamics in Marfan's syndrome ...
Dominik Schneidereit   +10 more
wiley   +1 more source

Packing chromatic numbers of finite super subdivisions of graphs

open access: yesFilomat, 2020
Given a graph G and a positive integer i, an i-packing in G is a subset W of the vertex set of G such that the distance between any two distinct vertices from W is greater than i. The packing chromatic number of a graph G, ??(G), is the smallest integer k such that the vertex set of G can be partitioned into sets Vi, i ?
Lemdani, Rachid   +2 more
openaire   +3 more sources

Cross‐scale Material‐Structure Synergy for 2D Metamaterials: Toward Customizable Intelligent Electromagnetic Manipulation in Multiphysics Fields

open access: yesAdvanced Science, EarlyView.
Recent advances in metasurface‐enabled low‐observable technologies are reviewed from the perspective of cross‐scale material–structure synergy. Electromagnetic, thermal, optical, and acoustic stealth are highlighted together with dynamic tuning, programmable coding, data‐driven inverse design, artificial intelligence, multispectral compatibility, and ...
Shuhao Wang   +5 more
wiley   +1 more source

Packing chromatic number of subcubic graphs

open access: yes, 2017
16 pages, 2 ...
Balogh, József   +2 more
openaire   +2 more sources

Packing Chromatic Number of Cycle Related Graphs

open access: yesInternational Journal of Mathematics and Soft Computing, 2014
The packing chromatic number I‡ (G) of a graph G is the smallest integer k for which there exists a mapping I  : V (G) −→ {1, 2, ..., k} such that any two vertices of color i are at distance at least i + 1. It is a frequency assignment problem used in wireless networks, which is also called Broadcasting coloring.
Indra Rajasingh   +2 more
openaire   +1 more source

Packing chromatic number of square lattice

open access: yes, 2022
A dissertation submitted in partial fulfilment of the requirements for the degree of Master of Science to the Faculty Science, School of Mathematics, University of the Witwatersrand, Johannesburg, 2022The notion of packing coloring comes from the area ...
Sarila, Jabulani Harmony
core  

Home - About - Disclaimer - Privacy