Results 101 to 110 of about 28,550 (268)
The aromatic ring of the title compound, C6H3ClN2O5, is almost planar (r.m.s. deviation = 0.007 Å); one nitro substituent is nearly coplanar with the ring [dihedral angle = 3(1)°], whereas the other is twisted [dihedral angle =
Seik Weng Ng
doaj +1 more source
Atomic Layer Deposition Processes: Versatile Platforms for Engineering ZnO‐Chitosan Biointerfaces
Vapour phase metalation (VPM), multiplied pulsed vapour phase infiltration (MPI), and O2 plasma‑enhanced atomic layer deposition (PEALD) tailor Zn–chitosan (Zn‑CS) films. PEALD improves wettability and biocompatibility. MPI enhances semiconductor behavior. Antiseptic selectivity: VPM → E. coli; MPI → H. pylori.
Mabel Moreno +17 more
wiley +1 more source
On the k-Structure Ratio in Planar and Outerplanar Graphs
A planar k-restricted structure is a simple graph whose blocks are planar and each has at most k vertices. Planar k-restricted structures are used by approximation algorithms for Maximum Weight Planar Subgraph, which motivates this work. The planar k-
Gruia Calinescu, Cristina G. Fernandes
doaj
We develop a covalent organic framework‐loaded Traditional Chinese Medicine monomer nanodrug delivery system (ISL@bCOF) via boron‐oxygen bonds, a smart response to glucose for delivering AI‐driven isoliquiritigenin (ISL) targeting ZBP1. This dynamic release mechanism, combined with transdermal delivery technology via potent microneedles, can modulate ...
Menghan Zhou +9 more
wiley +1 more source
Graphs cospectral with a friendship graph or its complement [PDF]
Let $n$ be any positive integer and let $F_n$ be the friendship (or Dutch windmill) graph with $2n+1$ vertices and $3n$ edges. Here we study graphs with the same adjacency spectrum as the $F_n$.
Alireza Abdollahi +2 more
doaj
This review examines how cellular behavior is regulated by mechanical cues transmitted through soft biomaterials, from single‐cell mechanosensing to tissue‐level adaptation. It highlights why physiological relevance, rather than model complexity alone, is critical for translational mechanobiology and introduces a scoring framework linking material ...
Mathias Polz +9 more
wiley +1 more source
Strictly-convex drawings of 3-connected planar graphs
Strictly-convex straight-line drawings of $3$-connected planar graphs in small area form a classical research topic in Graph Drawing. Currently, the best-known area bound for such drawings of $n$-vertex graphs is $O(n^2) \times O(n^2)$, as shown by ...
Michael Bekos +3 more
doaj +1 more source
On 1-Planar Graphs with Bounded Cop-Number
Cops and Robbers is a type of pursuit-evasion game played on a graph where a set of cops try to capture a single robber. The cops first choose their initial vertex positions, and later the robber chooses a vertex. The cops and robbers make their moves in alternate turns: in the cops' turn, every cop can either choose to move to an adjacent vertex or ...
Prosenjit Bose +3 more
openaire +3 more sources
Bioinspired Adaptive Sensors: A Review on Current Developments in Theory and Application
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
Large matchings in maximal 1-planar graphs
It is well-known that every maximal planar graph has a matching of size at least $\tfrac{n+8}{3}$ if $n\geq 14$. In this paper, we investigate similar matching-bounds for maximal \emph{1-planar} graphs, i.e., graphs that can be drawn such that every edge has at most one crossing.
Therese Biedl, John Wittnebel
openaire +2 more sources

