Results 131 to 140 of about 1,207,649 (297)

An Odd Characterization of the Generalized Odd Graphs [PDF]

open access: yes
2010 Mathematics Subject Classification: 05E30, 05C50;distance-regular graphs;generalized odd graphs;odd-girth;spectra of graphs;spectral excess theorem;spectral ...
Dam, E.R. van, Haemers, W.H.
core  

Self‐Sealing Microneedles Improve Precision and Reduce Reflux in Subretinal Cell Transplantation

open access: yesAdvanced Materials Technologies, EarlyView.
Ultrafine 49G microneedles enable subretinal delivery of induced pluripotent stem cell‐derived retinal pigment epithelial cells through a 50 µm outer diameter tip. Compared with conventional 38G microcannulas, these microneedles reduce cell suspension reflux in a rabbit model, highlighting the potential of microinvasive delivery instruments to improve ...
Jared Ching   +9 more
wiley   +1 more source

Polarity of chordal graphs

open access: yes
Polar graphs are a common generalization of bipartite, cobipartite, and split graphs. They are defined by the existence of a certain partition of vertices, which is NP-complete to decide for general graphs.
Ekim, Tinaz   +3 more
core   +1 more source

Single‐Step Fabrication of Smart 3D Microstructures Exploiting Naphthopyrans as Photoinitiators and Photochromic Molecules

open access: yesAdvanced Optical Materials, EarlyView.
Naphthopyran–benzophenone compounds can act simultaneously as photoinitiators and photochromic molecules for two‐photon polymerization. Using a single‐step process, liquid photoresist is encapsulated within polymerized 3D microstructures, preserving reversible UV–vis photochromism after fabrication.
João P. Leote   +5 more
wiley   +1 more source

Developments on Spectral Characterizations of Graphs [PDF]

open access: yes
In [E.R. van Dam and W.H. Haemers, Which graphs are determined by their spectrum?, Linear Algebra Appl. 373 (2003), 241-272] we gave a survey of answers to the question of which graphs are determined by the spectrum of some matrix associated to the graph.
Dam, E.R. van, Haemers, W.H.
core  

Scalable Task Planning via Large Language Models and Structured World Representations

open access: yesAdvanced 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

Grounding Large Language Models for Robot Task Planning Using Closed‐Loop State Feedback

open access: yesAdvanced Robotics Research, EarlyView.
BrainBody‐Large Language Model (LLM) introduces a hierarchical, feedback‐driven planning framework where two LLMs coordinate high‐level reasoning and low‐level control for robotic tasks. By grounding decisions in real‐time state feedback, it reduces hallucinations and improves task reliability.
Vineet Bhat   +4 more
wiley   +1 more source

A Structural Approach to Burning Number

open access: yesJournal of Social Structure
Graph burning is a deterministic discrete-time process that models the propagation of information within a network as a set of fires that spread in a graph. The associated graph parameter, the burning number, measures the speed of that spread.
Guillaume Jean, Williams Tyriana
doaj   +1 more source

Asymmetry in Skipping Enhances Viability Against Control Input Noise

open access: yesAdvanced 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

Minimal separators in extended P-4-laden graphs

open access: yes, 2015
In this paper, we use the primeval decomposition tree to compute the minimal separators of some graphs and to describe a linear-time algorithm that lists the minimal separators of extended P4-laden graphs, extending an algorithm for P4-sparse graphs ...
Pedrotti, V, de Mello, CP
core   +1 more source

Home - About - Disclaimer - Privacy