Results 101 to 110 of about 15,555,412 (284)

Electronics‐Free Visual Monitoring of Dry Eye Disease‐Related Tear Biomarkers Using Smart Scleral Lenses

open access: yesAdvanced Science, EarlyView.
An electronics‐free smart scleral lens passively monitors dry eye disease‐related tear biomarkers through colorimetric sensing of chloride, pH, and ocular surface temperature. Smartphone‐assisted image analysis enables quantitative interpretation, providing a simple, non‐invasive strategy for ocular health monitoring without integrated electronics ...
Ziheng Wang   +15 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

Bounds on the complex zeros of (Di)Chromatic polynomials and Potts-model partition functions [PDF]

open access: yes, 2001
We show that there exist universal constants C(r) such that, for all loopless graphs G of maximum degree less than or equal to r, the zeros (real or complex) of the chromatic polynomial P-G(q) lie in the disc \q\ 7.963907r.
Sokal, AD
core  

Equitable Coloring on Total Graph of Bigraphs and Central Graph of Cycles and Paths

open access: yesInternational Journal of Mathematics and Mathematical Sciences, 2011
The notion of equitable coloring was introduced by Meyer in 1973. In this paper we obtain interesting results regarding the equitable chromatic number 𝜒= for the total graph of complete bigraphs 𝑇(𝐾𝑚,𝑛), the central graph of cycles 𝐶(𝐶𝑛) and the central ...
J. Vernold Vivin   +2 more
doaj   +1 more source

0034 | Chromatic Number and Neutrosophic Chromatic Number

open access: yes, 2021
New setting is introduced to study chromatic number. Neutrosophic chromatic number and chromatic number are proposed in this way, some results are obtained.
Henry Garrett
core   +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

Mechanophore‐Based Multichannel Colorimetric Force Sensors: Ultrasound‐Driven Stress and Strain Quantification

open access: yesAdvanced Science, EarlyView.
ABSTRACT Mechanophores with mechanochromic properties have attracted significant attention as force‐responsive materials for structural sensing. However, their applications remain mainly limited to qualitative force visualization, as direct and quantitative extraction of mechanical parameters such as stress and strain from mechanochromic responses has ...
Seungo Baek   +8 more
wiley   +1 more source

Total chromatic number of chordless graphs

open access: yes, 2010
11 p. : il.A graph G is said to be chordless if no cycle in G has a chord. Chordless graphs are exactly the graphs whose line graphs are wheelfree, which implies a connection between the study of the chromatic index of chordless graphs and the study of ...
Figueiredo, Celina Miraglia Herrera de   +1 more
core  

Total b-chromatic Colouring of Graphs [PDF]

open access: yes
A b-chromatic colouring of a graph G is a proper k-colouring of the vertices of G, for some integer k, such that, for each colour i (1 ≤ i ≤ k), there exists a vertex v of colour i such that v is adjacent to a vertex of colour j, for each j (1 ≤ j ≤ k, j
Mendoza Granada, Fabricio Augusto   +1 more
core   +1 more source

Home - About - Disclaimer - Privacy