Results 71 to 80 of about 26,192 (266)
Cubic Cayley Graphs and Snarks
, 2014 The well-known conjecture that there are no snarks amongst Cayley graphs is considered. Combining the theory of Cayley maps with the existence of certain kinds of independent sets of vertices in arc-transitive graphs, some new partial results are obtained suggesting promising future research directions in regards to this conjecture.
Kutnar, Klavdija +2 more
openaire +2 more sources
Advanced Healthcare Materials, EarlyView.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
Normal 5-edge-colorings of a family of Loupekhine snarks
AKCE International Journal of Graphs and Combinatorics, 2020 In a proper edge-coloring of a cubic graph an edge uv is called poor or rich, if the set of colors of the edges incident to u and v contains exactly three or five colors, respectively.
Luca Ferrarini +2 more
doaj +1 more source
Advanced Healthcare Materials, EarlyView.Coarse‐grained MD simulations capture the effects of liposome composition and size on protein adsorption onto the liposome surface, in agreement with experiments. Liposome‐protein interactions are energetically stabilized by the replacement of abundant proteins with high‐affinity proteins on the liposome surface through electrostatic and hydrophobic ...
Hwankyu Lee
wiley +1 more source
Advanced Materials, EarlyView.AI‐Assisted Workflow for (Scanning) Transmission Electron Microscopy: From Data Analysis Automation to Materials Knowledge Unveiling. Abstract (Scanning) transmission electron microscopy ((S)TEM) has significantly advanced materials science but faces challenges in correlating precise atomic structure information with the functional properties of ...
Marc Botifoll +19 more
wiley +1 more source
Infinite families of asymmetric graphs
AKCE International Journal of Graphs and Combinatorics, 2020 A graph G is asymmetric if its automorphism group of vertices is trivial. Asymmetric graphs were introduced by Erdős and Rényi in 1963. They showed that the probability of a graph on n vertices being asymmetric tends to 1 as n tends to infinity.
Alejandra Brewer +5 more
doaj +1 more source
Gromov hyperbolic cubic graphs
Open Mathematics, 2012 Abstract If X is a geodesic metric space and x 1; x 2; x 3 ∈ X, a geodesic triangle T = {x 1; x 2; x 3} is the union of the three geodesics [x 1 x
Pestana Domingo +3 more
openaire +2 more sources
Advanced Materials, EarlyView.An ion‐mediated structural engineering strategy enables versatile modulation of PVA–Alginate hydrogel microstructure. We systematically examine how different ion combinations affect hydrogel mechanical properties and analyte diffusivity. Applying this novel strategy to hydrogel as the outer membrane in an electrochemical glucose biosensor allows ...
Dongwook Lee +14 more
wiley +1 more source
On cyclically 4-connected cubic graphs
AKCE International Journal of Graphs and CombinatoricsA 3-connected cubic graph is cyclically 4-connected if it has at least [Formula: see text] vertices and when removal of a set of three edges results in a disconnected graph, only one component has cycles.
R. J. Kingan, S. R. Kingan
doaj +1 more source
Steinitz theorems for simple orthogonal polyhedra
Journal of Computational Geometry, 2014 We define a simple orthogonal polyhedron to be a three-dimensional polyhedron with the topology of a sphere in which three mutually-perpendicular edges meet at each vertex.By analogy to Steinitz's theorem characterizing the graphs of convex polyhedra, we
David Eppstein, Elena Mumford
doaj +1 more source