Results 41 to 50 of about 442,994 (288)
Cards of fixed points of some Lotka-Volterra operators [PDF]
E-Journal of Analysis and Applied MathematicsThe paper considers a special type of the Lotka-Volterra operator operating in a four-dimensional simplex. The tournament corresponding to this operator has four cyclic triples. All kinds of fixed point cards are built for it. It is proved which types of
Dilfuza B. Eshmamatova +1 more
doaj +1 more source
Hamilton ℓ-cycles in uniform hypergraphs
Journal of Combinatorial Theory, Series A, 2010 v3: corrected very minor error in Lemma 4.6 and the proof of Lemma 6 ...
Kühn, Daniela +2 more
openaire +2 more sources
Notes on sufficient conditions for a graph to be Hamiltonian
International Journal of Mathematics and Mathematical Sciences, 1991 The first part of this paper deals with an extension of Dirac's Theorem to directed graphs. It is related to a result often referred to as the Ghouila-Houri Theorem.
Michael Joseph Paul +2 more
doaj +1 more source
M-alternating Hamilton paths and M-alternating Hamilton cycles
Discrete Mathematics, 2009 published in Discrete ...
Zhang, Zan-Bo, Li, Yueping, Lou, Dingjun
openaire +2 more sources
Color‐biased Hamilton cycles in random graphs
Random Structures & Algorithms, 2021 AbstractWe prove that a random graph , with p above the Hamiltonicity threshold, is typically such that for any r‐coloring of its edges there exists a Hamilton cycle with at least edges of the same color. This estimate is asymptotically optimal.
Gishboliner, Lior +2 more
openaire +2 more sources
Biomass Native Structure Into Functional Carbon‐Based Catalysts for Fenton‐Like Reactions
Advanced Functional Materials, EarlyView.This study indicates that eight biomasses with 2D flaky and 1D acicular structures influence surface O types, morphology, defects, N doping, sp2 C, and Co nanoparticles loading in three series of carbon, N‐doped carbon, and cobalt/graphitic carbon. This work identifies how these structural factors impact catalytic pathways, enhancing selective electron
Wenjie Tian +7 more
wiley +1 more source
A short proof of the middle levels theorem
Discrete Analysis, 2018 A short proof of the middle-levels theorem, Discrete Analysis 2018:8, 12 pp. Let $n$ be a positive integer, and define a bipartite graph where one vertex set consists of all subsets of $\{1,2,\dots,2n+1\}$ of size $n$, the other consists of all subsets ...
Petr Gregor +2 more
doaj +1 more source
Edge Disjoint Hamilton Cycles in Knödel Graphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2016 The vertices of the Knödel graph $W_{\Delta, n}$ on $n \geq 2$ vertices, $n$ even, and of maximum degree $\Delta, 1 \leq \Delta \leq \lfloor log_2(n) \rfloor$, are the pairs $(i,j)$ with $i=1,2$ and $0 \leq j \leq \frac{n}{2} -1$.
Palanivel Subramania Nadar Paulraja +1 more
doaj +1 more source
Parameterized TSP: Beating the Average [PDF]
, 2014 In the Travelling Salesman Problem (TSP), we are given a complete graph $K_n$ together with an integer weighting $w$ on the edges of $K_n$, and we are asked to find a Hamilton cycle of $K_n$ of minimum weight.
Gutin, Gregory, Patel, Viresh
core
Advanced Functional Materials, EarlyView.A FeN4─O/Clu@NC‐0.1Ac catalyst containing atomically‐dispersed FeN4─O sites (medium‐spin Fe2+) and Fe clusters delivered a half‐wave potential of 0.89 V for ORR and an overpotential of 330 mV at 10 mA cm−2 for OER in 0.1 m KOH. When the catalyst was used in a rechargeable Zn–air battery, a power density of 284.5 mW cm−2 was achieved with excellent ...
Yongfang Zhou +8 more
wiley +1 more source