Results 81 to 90 of about 649,418 (326)
Weakly toll convexity and proper interval graphs [PDF]
A walk $u_0u_1 \ldots u_{k-1}u_k$ is a \textit{weakly toll walk} if $u_0u_i \in E(G)$ implies $u_i = u_1$ and $u_ju_k\in E(G)$ implies $u_j=u_{k-1}$. A set $S$ of vertices of $G$ is {\it weakly toll convex} if for any two non-adjacent vertices $x,y \in S$
Mitre C. Dourado +3 more
doaj +1 more source
The $2+1$ convex hull of a finite set
We study $\mathbb{R}^2\oplus\mathbb{R}$-separately convex hulls of finite sets of points in $\mathbb{R}^3$, as introduced in \cite{KirchheimMullerSverak2003}.
Angulo, Pablo +2 more
core
Viscoelasticity‐driven instabilities are harnessed to create tunable, periodic textures in 3D‐printed liquid crystalline polymers. This study illustrates how processing parameters control these spontaneous meso‐scale patterns. These unique structural architectures unlock new possibilities for functional devices, ranging from photonic components to ...
Miaomiao Zou +17 more
wiley +1 more source
Broadband, Flexible, Skin‐Compatible Carbon Dots/Graphene Photodetectors for Wearable Applications
Broadband, flexible photodetectors integrating nitrogen‐rich carbon dots with single‐layer graphene on plastic substrates are demonstrated. A biocompatible chitosan–glycerol electrolyte enables efficient low‐voltage gating and on‐skin operation. The devices exhibit ultraviolet‐to‐near‐infrared response, mechanical robustness under bending, and verified
Nouha Loudhaief +20 more
wiley +1 more source
Membrane Wrapping for High Capacity and Rapidly Switchable Adhesives
A membrane‐wrapping mechanism enables high‐capacity, rapidly switchable adhesion by coupling suction, friction, and adhesion. Broadband performance is achieved in dry and underwater conditions, allowing fast, reversible manipulation of objects of diverse sizes and shapes, from delicate eggs and berries to flat, complex, or heavy objects. These outcomes
Yeunhee Kim +2 more
wiley +1 more source
The convex domination subdivision number of a graph
Let $G=(V,E)$ be a simple graph. A set $D\subseteq V$ is a dominating set of $G$ if every vertex in $V\setminus D$ has at least one neighbor in $D$. The distance $d_G(u,v)$ between two vertices $u$ and $v$ is the length of a shortest $(u,v)$-
M. Dettlaff +3 more
doaj +1 more source
Permanent magnets derive their extraordinary strength from deep, universal electronic‐structure principles that control magnetization, anisotropy, and intrinsic performance. This work uncovers those governing rules, examines modern modeling and AI‐driven discovery methods, identifies critical bottlenecks, and reveals electronic fingerprints shared ...
Prashant Singh
wiley +1 more source
On the Computational Complexity of Optimization Convex Covering Problems of Graphs [PDF]
In this paper we present further studies of convex covers and convex partitions of graphs. Let $G$ be a finite simple graph. A set of vertices $S$ of $G$ is convex if all vertices lying on a shortest path between any pair of vertices of $S$ are in $S ...
Radu Buzatu
doaj
The use of continuous drop‐based force and energy probing methods is introduced to evaluate in situ chemical degradation of super liquid‐repellent surfaces by caustic liquids. By tracking the velocity of rolling drops and energy dissipation of impacting drops, degradation dynamics are resolved under high spatio‐temporal precision. Using this technique,
Parham Koochak +2 more
wiley +1 more source
Nanoscale‐grooved indium gallium oxide (IGO) semiconductors, patterned via thermal nanoimprint lithography (NIL) using CD/DVD templates, are integrated into electrolyte‐gated transistor biosensors to overcome Debye length limitations. Precisely engineered concave–convex nanostructures modulate local electrostatic potentials, extend the effective Debye ...
Jong Yu Song +5 more
wiley +1 more source

