Results 71 to 80 of about 445,337 (327)
A Triple of Heavy Subgraphs Ensuring Pancyclicity of 2-Connected Graphs
Discussiones Mathematicae Graph Theory, 2017 A graph G on n vertices is said to be pancyclic if it contains cycles of all lengths k for k ∈ {3, . . . , n}. A vertex v ∈ V (G) is called super-heavy if the number of its neighbours in G is at least (n+1)/2.
Wide Wojciech
doaj +1 more source
On hamiltonicity of uniform random intersection graphs
Lietuvos Matematikos Rinkinys, 2010 We give a sufficient condition for the hamiltonicity of the uniform random intersection graph G{n,m,d}. It is a graph on n vertices, where each vertex is assigned d keys drawn independently at random from a given set of m keys, and where any two vertices
Mindaugas Bloznelis +1 more
doaj +1 more source
Hamilton cycles and algorithms
, 2022 We present three results in graph theory, united by the themes of Hamilton cycles and algorithms. A Hamilton cycle in a graph is a cycle that contains every vertex of the graph. The first result concerns path decompositions of digraphs, specifically an extension of a conjecture due to Alspach, Mason, and Pullman.
openaire +2 more sources
Advanced Functional Materials, EarlyView.Herein, an RBC membrane‐derived nanoparticle (CMN‐ICG) is engineered to efficiently deliver a sonosensitizing agent, indocyanine green (ICG), for sonotherapy of hepatocellular carcinoma (HCC). CMN‐ICG exhibits excellent cytocompatibility, significantly enhances hepatocyte uptake, and produces excessive reactive oxygen species (ROS) upon ultrasound ...
Alap Ali Zahid +6 more
wiley +1 more source
Have Business Cycles Become More Synchronous After NAFTA?
American Business Review, 2021 Trade agreements do not necessitate business cycle comovement. Focusing on NAFTA, we investigate whether business cycles in Canada, Mexico, and the US have become more synchronous after the landmark trade agreement came into effect in 1994.
Puneet Vatsa
doaj +1 more source
Decomposition into Cycles I: Hamilton Decompositions [PDF]
, 1990 In this part we survey the results concerning the partitions of the edge-set of a graph into Hamilton cycles or into Hamilton cycles and a single perfect matching.
Alspach, Brian +2 more
openaire +2 more sources
Theory‐Guided Design of Non‐Precious Single‐Atom Catalyst for Electrocatalytic Chlorine Evolution
Advanced Functional Materials, EarlyView.To overcome the reliance on noble metals for the chlorine evolution reaction (CER), we designed a non‐precious single‐atom catalyst (SAC), NiN3O–O. It achieves a low overpotential of 75 mV, 95.8% Cl2 selectivity, and outperforms commercial dimensionally stable anodes (DSAs).
Kai Ma +9 more
wiley +1 more source
Dating the business cycle: Evidence from Mongolia
Central Bank Review, 2019 Business cycle is an important indicator for making policy and management decisions. This paper compares the business cycle estimates for Mongolia based on a graphical and parametric methods.
Davaajargal Luvsannyam +2 more
doaj +1 more source
Advanced Functional Materials, EarlyView.This work provides a novel interpretation of the nitrate reduction mechanism on iron oxides (FeOx) by employing constant‐potential density functional calculations and reports the design and synthesis of a robust and high‐performance Fe3O4/Fe‐N4‐C catalyst with remarkable Faradaic efficiency, current density, and stability under practical reaction ...
Qiang Zhou +8 more
wiley +1 more source
Semi-perfect 1-Factorizations of the Hypercube
, 2018 A 1-factorization $\mathcal{M} = \{M_1,M_2,\ldots,M_n\}$ of a graph $G$ is called perfect if the union of any pair of 1-factors $M_i, M_j$ with $i \ne j$ is a Hamilton cycle.
Behague, Natalie C.
core +1 more source