Results 121 to 130 of about 520,977 (330)

Hierarchical complexity of 2-clique-colouring weakly chordal graphs and perfect graphs having cliques of size at least 3 [PDF]

, 2013
Hélio B. Macêdo Filho, Raphael C. S. Machado, Celina M.H. de Figueiredo   +2 more
openalex   +1 more source

Data‐Driven Bulldozer Blade Control for Autonomous Terrain Leveling

Advanced Robotics Research, EarlyView.
A simulation‐driven framework for autonomous bulldozer leveling is presented, combining high‐fidelity terramechanics simulation with a neural‐network‐based reduced‐order model. Gradient‐based optimization enables efficient, low‐level blade control that balances leveling quality and operation time.
Harry Zhang, Ganesh Arivoli, Huzaifa Unjhawala, Luning Bakke, Radu Serban, Dan Negrut   +5 more
wiley   +1 more source

Core Index of Perfect Matching Polytope for a 2-Connected Cubic Graph

Discussiones Mathematicae Graph Theory, 2018
For a 2-connected cubic graph G, the perfect matching polytope P(G) of G contains a special point xc=(13,13,…,13)$x^c = \left( {{1 \over 3},{1 \over 3}, \ldots ,{1 \over 3}} \right)$ . The core index ϕ(P(G)) of the polytope P(G) is the minimum number of
Wang Xiumei, Lin Yixun
doaj   +1 more source

The Perfect Roman Domination of Some Cycle Related Graphs

, 2023
Abolape Deborah Akwu
openalex   +1 more source

The spanning $k$-trees, perfect matchings and spectral radius of graphs [PDF]

, 2021
Dandan Fan, Sergey Goryainov, Xueyi Huang, Huiqiu Lin   +3 more
openalex   +1 more source

Smart REASSURED Sensors via Machine‐Augmented Printable On‐Paper Arrays

Advanced Sensor Research, EarlyView.
This perspective highlights the emerging role of pattern‐recognition, printable on‐paper sensor arrays for intelligent PoC diagnostics. It discusses how paper's inherent limitations can be overcome through surface modification and scalable printing, and how machine‐learning analysis of cross‐reactive arrays enables multiplexed, low‐cost, and REASSURED ...
Naimeh Naseri, Saba Ranjbar
wiley   +1 more source

Extracting perfect GHZ states from imperfect weighted graph states via entanglement concentration [PDF]

, 2023
Rafail Frantzeskakis, Chenxu Liu, Zahra Raissi, Edwin Barnes, Sophia E. Economou   +4 more
openalex   +1 more source

NARFL Knockout Triggers Ferroptosis‐Driven Vascular Endothelial Dysfunction

Advanced Science, EarlyView.
NARFL is vital for CIA and oxidative stress resistance. NARFL deletion in HPMEC cells, zebrafish, and mice is lethal and rescued by a Ferroptosis inhibitor. NARFL deficiency disrupted its interaction with CIA proteins, decreased aconitase activity, increased IRP1 activity, induced Fe overload, and led to ferroptosis and oxidative stress, resulting in ...
Hui Hu, Jing Luo, Li Yu, Daoxi Qi, Boyu Li, Yating Chen, Chen Wang, Xiaokang Zhang, Wenzheng Guo, Qiyong Lou, Gang Zhai, Yonglin Ruan, Jianfei Huang, Shengchi Shi, Zhan Yin, Fang Zheng   +15 more
wiley   +1 more source

Strong Proton‐Phonon Coupling Drives Fast Ion Transport in Perovskites

Advanced Science, EarlyView.
Experimental and computational phonon analysis of ABO3‐type proton conductor BaSnO3 shows that substitution on the B‐site with yttrium forms an imaginary phonon mode which is instrumental for the function as proton conductor. This overcompensates the adverse proton trapping effect of the yttrium.
Alexey Rulev, Nobumoto Nagasawa, Hongxin Wang, Vladimir Pomjakushin, Martin Kunz, Yoshitaka Yoda, Stephen P. Cramer, Qianli Chen, Artur Braun   +8 more
wiley   +1 more source

Irredundance perfect graphs

Discrete Mathematics, 1995
Let \(G\) be a graph. A set \(X\) of vertices of \(G\) is said to be a dominating set of vertices of \(G\) if \(V(G)\) is contained in the closed neighbourhood of \(X\). The smallest cardinality of a dominating set of vertices in \(G\) is called the domination number of \(G\) and is denoted by \(\gamma(G)\). Let \(X\) be a set of vertices of \(G\).
openaire   +1 more source