Results 131 to 140 of about 174,518,636 (296)
Sparse vertex cutsets and the maximum degree
, 2023 We show that every graph $G$ of maximum degree $\Delta$ and sufficiently large order has a vertex cutset $S$ of order at most $\Delta$ that induces a subgraph $G[S]$ of maximum degree at most $\Delta-3$. For $\Delta\in \{ 4,5\}$, we refine this result by
Souza, Uéverton S. +3 more
core
Sum of Squares of Vertex Degrees of Simple Planar (n, m)-Graphs [PDF]
Discrete Mathematics LettersBatmend Horoldagva +2 more
doaj +1 more source
Degree subtraction eigenvalues and energy of graphs [PDF]
Computer Science Journal of Moldova, 2018 The degree subtraction matrix $DS(G)$ of a graph $G$ is introduced, whose $(j,k)$-th entry is $d_G(v_j) - d_G(v_k)$, where $d_G(v_j)$ is the degree of a vertex $v_j$ in $G$.
H. S. Ramane +3 more
doaj
Advanced Materials Technologies, EarlyView.Chitin‐chitosan cryogels with degrees of N‐acetylation from 12.2% to 71.4% are fabricated by dissolution, coagulation and lyophilization for the sequestration of heavy metals from water. Colorimetry and differential pulse voltammetry showed controlled adsorption and desorption capacities for As5+, Co2+ and Cu2+, making this material attractive for ...
Marta García‐Castrillo +4 more
wiley +1 more source
Advanced Materials Technologies, EarlyView.A CNT‐reinforced dual‐network hydrogel combines ionic liquid‐mediated thermoresponsiveness, dynamic covalent crosslinking, and conductive nanostructures within a single adaptive material. The hydrogel exhibits ultrafast gelation, autonomous self‐healing, >1000% stretchability, reversible optical switching, and stable electromechanical sensing, enabling
Xia Qiu +6 more
wiley +1 more source
Scalable Task Planning via Large Language Models and Structured World Representations
Advanced Robotics Research, EarlyView.This work efficiently combines graph‐based world representations with the commonsense knowledge in Large Language Models to enhance planning techniques for the large‐scale environments that modern robots will need to face. Planning methods often struggle with computational intractability when solving task‐level problems in large‐scale environments ...
Rodrigo Pérez‐Dattari +4 more
wiley +1 more source
THE ZAGREB ECCENTRIC VERTEX DEGREE INDICES OF NANOTUBES AND NANOTORI
, 2016 The eccentric vertex degree of a vertex v of a simple connected graph G, e(v), is defined as: max{d(u1),d(u2,) ..., d(un)}, where d(ui) denotes the degree of the vertex of u(i) which is one of the furthest vertices from v.
Ediz, Süleyman
core +1 more source
Advanced Robotics Research, EarlyView.An AI‐powered, robot‐assisted framework automatically produces, images, and analyzes 3D tumor spheroids to evaluate drug efficacy. Integrated modules handle spheroid formation, live/dead staining, brightfield imaging, and automated image analysis, including spheroid segmentation, viability and metrics to assess the drug treatment efficacy. The workflow
Dalia Mahdy +13 more
wiley +1 more source
Self-locking degree-4 vertex origami structures. [PDF]
Proc Math Phys Eng Sci, 2016 Fang H, Li S, Wang KW.
europepmc +1 more source
Asymmetry in Skipping Enhances Viability Against Control Input Noise
Advanced Robotics Research, EarlyView.Quadruped animals use asymmetric galloping gaits at high speeds, yet the functional role of this asymmetry remains unclear. This study shows that left–right asymmetry in touchdown angles enhances robustness to control noise. Using a simple two‐legged locomotion model and viability theory, it demonstrates that asymmetric skipping substantially enlarges ...
Yuichi Ambe, Alvin So, Shinya Aoi
wiley +1 more source