Results 41 to 50 of about 117,362 (280)
Abstract Abstract A graph G , is λ-regular-stable if it has at least a maximum independent set I , such that for ∀ v ∈ V(G)\I , the number of vertices in NG(V) , ⨆ I , is constant, and equal to λ. Here we give some results for this class of graphs.
Barbosa, R., Cardoso, D.M.
openaire +2 more sources
Probabilistic regular graphs [PDF]
In Proceedings INFINITY 2010, arXiv:1010 ...
Bertrand, Nathalie, Morvan, Christophe
openaire +4 more sources
Gold bipyramids can act as efficient plasmonic nanoheaters, but they often reshape during laser heating. This study shows that oxygen nanobubbles drive oxidative etching and that surface ligands control stability. CTAB‐ and citrate‐coated particles blunt and lose optical performance, whereas polystyrene sulfonate preserves shape and heating by ...
Irene López‐Sicilia +7 more
wiley +1 more source
This is a survey of distance-regular graphs. We present an introduction to distance-regular graphs for the reader who is unfamiliar with the subject, and then give an overview of some developments in the area of distance-regular graphs since the monograph 'BCN' [Brouwer, A.E., Cohen, A.M., Neumaier, A., Distance-Regular Graphs, Springer-Verlag, Berlin,
Edwin R. van Dam +2 more
openaire +4 more sources
Active Learning‐Accelerated Discovery of Fibrous Hydrogels with Tissue‐Mimetic Viscoelasticity
Active learning accelerates the design of fibrous hydrogels that mimic the viscoelasticity of native tissues. By integrating multi‐objective optimization and closed‐loop experimentation, this approach efficiently identifies optimal formulations from thousands of possibilities and decouples elasticity and viscosity. The resulting hydrogels offer tunable
Zhengkun Chen +11 more
wiley +1 more source
Community detection in dynamic networks has become an interesting and popular research direction in recent years, widely used in electronic commerce, social media, and other fields.
Wei Yu +6 more
doaj +1 more source
Double regularized matrix factorization for image classification and clustering
Feature selection, which aims to select an optimal feature subset to avoid the “curse of dimensionality,” is an important research topic in many real-world applications.
Wei Zhou +4 more
doaj +1 more source
Building a Graph Signal Processing Model Using Dynamic Time Warping for Load Disaggregation
Building on recent unsupervised Non-intrusive load monitoring (NILM) algorithms that use graph Laplacian regularization (GLR) and achieve state-of-the-art performance, in this paper, we propose a novel unsupervised approach to design an underlying graph ...
Kanghang He +2 more
doaj +1 more source
An algorithm to prescribe the configuration of a finite graph [PDF]
We provide algorithms involving edge slides, for a connected simple graph to evolve in a finite number of steps to another connected simple graph in a prescribed configuration, and for the regularization of such a graph by the minimization of an ...
Baird, Paul, Tiba, Marius
core
A two‐phase workflow (OFAT screening followed by central composite design) maps how processing variables tune PFCE‐PLGA nanoparticle size, dispersity, surface charge, loading, and 19F‐MRI signal. In situ, time‐resolved synchrotron SAXS tracks albumin‐corona growth on intact dispersions and reveals PFCE‐dependent adsorption pathways.
Joice Maria Joseph +11 more
wiley +1 more source

