Results 71 to 80 of about 6,009 (241)
The irregularity of two types of trees [PDF]
The irregularity of a graph $G$ is defined as the sum of weights $|d(u)-d(v)|$ of all edges $uv$ of $G$, where $d(u)$ and $d(v)$ are the degrees of the vertices $u$ and $v$ in $G$, respectively.
Li Jianxi, Yang Liu, Wai Shiu
doaj +1 more source
This study examines how pore shape and manufacturing‐induced deviations affect the mechanical properties of 3D‐printed lattice materials with constant porosity. Combining µ‐CT analysis, FEM, and compression testing, the authors show that structural imperfections reduce stiffness and strength, while bulk material inhomogeneities probably enhance ...
Oliver Walker +5 more
wiley +1 more source
Extremal trees with fixed degree sequence for $\sigma$-irregularity [PDF]
Darko Dimitrov +3 more
doaj +1 more source
Implementation of Drug‐Induced Rhabdomyolysis and Acute Kidney Injury in Microphysiological System
A modular Muscle–Kidney proximal tubule‐on‐a‐chip integrates 3D skeletal muscle and renal proximal tubule tissues to model drug‐induced rhabdomyolysis and acute kidney injury. The coculture system enables dynamic tissue interaction, functional contraction monitoring, and quantification of nephrotoxicity, revealing drug side effect‐induced metabolic ...
Jaesang Kim +4 more
wiley +1 more source
An All‐Optical Driven Bio‐Photovoltaic Interface for Active Control of Live Cells
Bio‐photovoltaic Interface (BIO‐PV‐I) for live cell manipulation is presented. BIO‐PV‐I can be activated non‐invasively and remotely to control the spatial motility, adhesion, and morphology of cells adhering to it. BIO‐PV‐I uses a patterned light‐induced electric potential in iron‐doped lithium niobate crystals whose light‐driven and reversible nature,
Lisa Miccio +8 more
wiley +1 more source
Computing the total H-irregularity strength of edge comb product of graphs
A simple undirected graph = (V Γ, EΓ) admits an H-covering if every edge in E belongs to at least one subgraph of that is isomorphic to a graph H. For any graph admitting H-covering, a total labelling β : VΓ ∪EΓ→{1, 2, …, p} is called an H-irregular ...
Wahyujati Mohamad Fahruli, Susanti Yeni
doaj +1 more source
Irregular colorings of regular graphs
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Anderson, Mark +2 more
openaire +2 more sources
Interconnected Porous Hydrogels with Tunable Anisotropy Through Aqueous Emulsion Bioprinting
A 3D bioprintable microporous bioink is developed using an aqueous two‐phase system (ATPS) composed of extracellular matrix (ECM) mimetic biopolymers. The ATPS bioink enables the fabrication of interconnected porous architectures with up to 70% porosity, supporting long‐term cell viability and 3D cell alignment, enabling a simultaneous generation of ...
Hugo Edgar‐Vilar +4 more
wiley +1 more source
Gourd‐Inspired Design of Unit Cell with Multiple Gradients for Physiological‐Range Pressure Sensing
Gourd‐shaped micro‐dome arrays with coordinated modulus, conductivity, and geometric gradients co‐optimize sensitivity and linearity in piezoresistive tactile sensors. Under pressure, a solid upper dome embeds into a porous lower dome, triggering rapid contact‐area growth and series‐to‐parallel conduction, enabling unsaturated, intensity‐resolved ...
Jiayi Xu +6 more
wiley +1 more source
On The Total Irregularity Strength of Regular Graphs
Let 𝐺 = (𝑉, 𝐸) be a graph. A total labeling 𝑓: 𝑉 ∪ 𝐸 → {1, 2, ⋯ , 𝑘} is called a totally irregular total 𝑘-labeling of 𝐺 if every two distinct vertices 𝑥 and 𝑦 in 𝑉 satisfy 𝑤𝑓(𝑥) ≠ 𝑤𝑓(𝑦) and every two distinct edges 𝑥1𝑥2 and 𝑦1𝑦2 in 𝐸 satisfy 𝑤𝑓(𝑥1𝑥2 ...
Rismawati Ramdani +2 more
doaj +1 more source

