Results 71 to 80 of about 357,448 (292)
Small Complete Minors Above the Extremal Edge Density [PDF]
, 2012 A fundamental result of Mader from 1972 asserts that a graph of high average degree contains a highly connected subgraph with roughly the same average degree. We prove a lemma showing that one can strengthen Mader's result by replacing the notion of high
Shapira, Asaf, Sudakov, Benny
core
Error Graphs and the Reconstruction of Elements in Groups [PDF]
, 2009 Packing and covering problems for metric spaces, and graphs in particular, are of essential interest in combinatorics and coding theory. They are formulated in terms of metric balls of vertices.
Levenshtein, Vladimir, Siemons, Johannes
core +2 more sources
Machine Learning‐Enabled Polymer Discovery for Enhanced Pulmonary siRNA Delivery
Advanced Functional Materials, EarlyView.This study provides an efficient approach to train a machine learning model by merging heterogeneous literature data to predict suitable polymers for siRNA delivery. Without the need for extensive laboratory synthesis, the machine learning enabled a virtual screening and successfully predicted a polymer that is validated for effective gene silencing in
Felix Sieber‐Schäfer +10 more
wiley +1 more source
Square Property, Equitable Partitions, and Product-like Graphs [PDF]
, 2013 Equivalence relations on the edge set of a graph $G$ that satisfy restrictive conditions on chordless squares play a crucial role in the theory of Cartesian graph products and graph bundles.
Hellmuth, Marc +2 more
core +1 more source
Vertex Cover Hop Dominating Sets in Graphs
European Journal of Pure and Applied MathematicsLet $G$ be a graph. Then a subset $C$ of vertices of $G$ is called a vertex cover hop dominating if $C$ is both a vertex cover and a hop dominating of $G$.
Vergel T. Bilar +3 more
semanticscholar +1 more source
Omnidirectional Transmissive Acoustic Metasurfaces Based on Goldberg Polyhedra
Advanced Functional Materials, EarlyView.This study introduces omnidirectional acoustic metasurfaces capable of manipulating wavefronts in multiple arbitrary directions simultaneously. A full‐stack pipeline for design, optimization, and fabrication is presented to construct near‐spherical holograms based on Goldberg polyhedra.
Andrea Achilleos +3 more
wiley +1 more source
Knots and Knot-Hyperpaths in Hypergraphs
Mathematics, 2022 This paper deals with some theoretical aspects of hypergraphs related to hyperpaths and hypertrees. In ordinary graph theory, the intersecting or adjacent edges contain exactly one vertex; however, in the case of hypergraph theory, the adjacent or ...
Saifur Rahman +3 more
doaj +1 more source
Spin Foams Without Spins [PDF]
, 2016 We formulate the spin foam representation of discrete SU(2) gauge theory as a product of vertex amplitudes each of which is the spin network generating function of the boundary graph dual to the vertex.
Hnybida, Jeff
core +2 more sources
Complex & Intelligent Systems, 2020 This article introduces the notion of vertex rough graph and discusses certain basic graph theoretic definitions and examples. Adjacency of vertices is used to create a matrix corresponding to a vertex rough graph.
B. Mathew, S. J. John, Harish Garg
semanticscholar +1 more source
Synthetic Strategy for mRNA Encapsulation and Gene Delivery with Nanoscale Metal‐Organic Frameworks
Advanced Functional Materials, EarlyView.This research utilizes the ZIF‐8 for the encapsulation and intracellular delivery of nucleic acids, specifically mRNA, for applications in gene delivery. Integrating PEI addresses the issue of mRNA leakage from ZIF‐8, resulting in the delivery and expression of green fluorescent protein (GFP) in vitro and firefly luciferase in vivo.
Harrison Douglas Lawson +12 more
wiley +1 more source