Results 81 to 90 of about 309,095 (284)
Large rainbow matchings in large graphs [PDF]
A \textit{rainbow subgraph} of an edge-colored graph is a subgraph whose edges have distinct colors. The \textit{color degree} of a vertex $v$ is the number of different colors on edges incident to $v$. We show that if $n$ is large enough (namely, $n\geq
Kostochka, Alexandr +2 more
core +1 more source
The separation of Helium gas from natural gas is challenging but highly important. MIL‐116(Ga), a “non‐porous” metal–organic framework is used as a molecular sieve to separate He from CH4. Druse‐like MIL‐116(Ga) particles are integrated into polysulfone mixed matrix membranes.
Ayisha Komal +10 more
wiley +1 more source
Degree-penalized contact processes
In this paper we study degree-penalized contact processes on Galton-Watson (GW) trees and the configuration model. The model we consider is a modification of the usual contact process on a graph.
Zsolt Bartha +2 more
doaj +1 more source
Intelligent radiative cooling devices, adaptable to various weather conditions, have the potential for year‐round energy savings. This study introduces a sustainable dual‐mode film made from polycaprolactone nanofibers and upcycled chip bags for effective thermal management.
Qimeng Song +4 more
wiley +1 more source
ORDERING CATACONDENSED HEXAGONAL SYSTEMS WITH RESPECT TO VDB TOPOLOGICAL INDICES
In this paper we give a complete description of the ordering relations in the set of catacondensed hexagonal systems, with respect to a vertex-degree-based topological index. As a consequence, extremal values of vertex-degree-based topological indices in
Juan Rada
doaj +1 more source
Lipid nanoparticles (LNPs) are optimized to co‐deliver Cas9‐encoding messenger RNA (mRNA), a single guide RNA (sgRNA) targeting the endogenous cystic fibrosis transmembrane conductance regulator (CFTR) gene, and homologous linear double‐stranded donor DNA (ldsDNA) templates encoding CFTR.
Ruth A. Foley +12 more
wiley +1 more source
Sparse Vertex Cutsets and the Maximum Degree
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 considering also the average degree of $G[S]$.
Bessy, Stéphane +3 more
openaire +3 more sources
Controlled syntheses of lanthanide coordination polymers based on the dihydroxybenzoquinone (DHBQ) organic linker afforded large single crystals of Ln‐DHBQ CPs (Ln = Yb, Nd). A novel structural variant of Yb‐DHBQ is identified by means of single crystal diffraction analysis.
Marina I. Schönherr +7 more
wiley +1 more source
On Bounded-Degree Vertex Deletion parameterized by treewidth
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Betzler, Nadja +3 more
openaire +1 more source
This study introduces a novel multi‐scale scaffold design using L‐fractals arranged in Archimedean tessellations for tissue regeneration. Despite similar porosity, tiles display vastly different tensile responses (1–100 MPa) and deformation modes. In vitro experiments with hMSCs show geometry‐dependent growth and activity. Over 55 000 tile combinations
Maria Kalogeropoulou +4 more
wiley +1 more source

