Results 41 to 50 of about 60,523 (284)
Loose Hamilton Cycles in Regular Hypergraphs [PDF]
Combinatorics, Probability and Computing, 2014 We establish a relation between two uniform models of randomk-graphs (for constantk⩾ 3) onnlabelled vertices: ℍ(k)(n,m), the randomk-graph with exactlymedges, and ℍ(k)(n,d), the randomd-regulark-graph. By extending the switching technique of McKay and Wormald tok-graphs, we show that, for some range ofd = d(n)and a constantc> 0, ifm~cnd, then one ...
Andrzej Dudek +3 more
openaire +4 more sources
Hamilton cycles in almost distance-hereditary graphs
Open Mathematics, 2016 Let G be a graph on n ≥ 3 vertices. A graph G is almost distance-hereditary if each connected induced subgraph H of G has the property dH(x, y) ≤ dG(x, y) + 1 for any pair of vertices x, y ∈ V(H).
Chen Bing, Ning Bo
doaj +1 more source
A Note on Barnette’s Conjecture
Discussiones Mathematicae Graph Theory, 2013 Barnette conjectured that each planar, bipartite, cubic, and 3-connected graph is hamiltonian. We prove that this conjecture is equivalent to the statement that there is a constant c > 0 such that each graph G of this class contains a path on at least c ...
Harant Jochen
doaj +1 more source
Advanced Functional Materials, EarlyView.The co‐doping strategy can effectively address the challenges associated with LRMOs cathode materials, providing a promising pathway for the development of high energy density and resilient cathode materials in the next‐generation lithium‐ion batteries. Abstract Lithium‐rich manganese‐based oxides (LRMOs) are promising cathode materials for lithium‐ion
Junxia Meng +11 more
wiley +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
Supercompliant Lattice Boosts n‐type AgSbTe2 Thermoelectrics
Advanced Functional Materials, EarlyView.The supercompliant lattice design enables the first realization of n‐type electrical transport in AgSbTe2 by overcoming intrinsic electron‐killer defects and exceeding the doping limits imposed by the conventional Hume–Rothery rule. Accordingly, the best performance n‐type Ag0.8Na0.3Sb0.6Bi0.4Te2 sample achieves a low κ of 0.27 W·m−1·K−1 that ...
Ruoyan Li +15 more
wiley +1 more source
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
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
PLoS ONE, 2021 Animal experiments have consistently shown that estrogen receptor β (ERβ)-selective ligands have antidepressant and anxiolytic effects. In humans, endogenous ligands for ERβ include 5α-androstane-3β, 17β-diol (3βAdiol) and androstenediol (Δ5-diol).
Haruka Tanabe +6 more
doaj +1 more source
Universality for transversal Hamilton cycles
Bulletin of the London Mathematical SocietyAbstractLet be a graph collection on a common vertex set of size such that for every . We show that contains every Hamilton cycle pattern. That is, for every map there is a Hamilton cycle whose th edge lies in .
Candida Bowtell +3 more
openaire +3 more sources