Results 91 to 100 of about 9,612,020 (345)

A Synovium‐on‐Chip Platform to Study Multicellular Interactions in Arthritis

open access: yesAdvanced Healthcare Materials, EarlyView.
The Synovium‐on‐Chip comprises a thin microporous PDMS membrane to support co‐culture of fibroblast‐like synoviocytes (FLS), THP‐1‐derived macrophages, and endothelial cells, enabling real‐time analysis of synovial‐vascular interactions. FLS migration through the pores drives endothelial remodeling, while TNF‐α stimulation induces robust inflammatory ...
Laurens R. Spoelstra   +8 more
wiley   +1 more source

Bioinspired Adaptive Sensors: A Review on Current Developments in Theory and Application

open access: yesAdvanced Materials, EarlyView.
This review comprehensively summarizes the recent progress in the design and fabrication of sensory‐adaptation‐inspired devices and highlights their valuable applications in electronic skin, wearable electronics, and machine vision. The existing challenges and future directions are addressed in aspects such as device performance optimization ...
Guodong Gong   +12 more
wiley   +1 more source

The locating-chromatic number for Halin graphs

open access: yesCommunications 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

The $b$-Chromatic Number and $f$-Chromatic Vertex Number of Regular Graphs

open access: yes, 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

A Soft Microrobot for Single‐Cell Transport, Spheroid Assembly, and Dual‐Mode Drug Screening

open access: yesAdvanced Materials, EarlyView.
A soft, untethered hydrogel microrobot enables precise single‐cell delivery, self‐assembly into 3D spheroids, and real‐time thermal actuation. Driven by light‐induced convection and embedded with gold nanorods and temperature sensors, the microrobot guides cells, modulates local microenvironments, and supports drug testing.
Philipp Harder   +3 more
wiley   +1 more source

The Incidence Chromatic Number of Toroidal Grids

open access: yesDiscussiones 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

On the r-dynamic chromatic number of the corronation by complete graph

open access: yes, 2018
In this paper we will study the r-dynamic chromatic number of the coronation by complete graph. A proper k-coloring of graph G such that the neighbors of any vertex v receive at least min{r, d(v)} different colors.
Arika Indah Kristiana   +2 more
semanticscholar   +1 more source

Chromatic Completion Number

open access: yes, 2018
12 pages, 2 ...
Mphako-Banda, E. G, Kok, J.
openaire   +2 more sources

Electrically Assisted Thermal Stamping of Tunable Carbon‐Based Nanofilms for Direct Fabrication of Hydrophobic, Energy Harvesting, and Sensing Devices

open access: yesAdvanced Materials, EarlyView.
Schematic illustration of the electrically assisted thermal stamping (EATS) method for direct fabrication of carbon‐based nanofilms and their multifunctional applications. Localized Joule heating triggers simultaneous exfoliation, reduction, and fluoropolymer incorporation under ambient conditions, yielding tunable carbon‐based thin‐film coatings ...
Byungseok Seo   +9 more
wiley   +1 more source

Some Equal Degree Graph Edge Chromatic Number

open access: yesMATEC Web of Conferences, 2016
Let G(V, E) be a simple graph and k is a positive integer, if it exists a mapping of f, and satisfied with f(e1)≠6 = f(e2) for two incident edges e1,e2∉E(G), f(e1)≠6=f(e2), then f is called the k-proper-edge coloring of G(k-PEC for short).
Liu Jun   +4 more
doaj   +1 more source

Home - About - Disclaimer - Privacy