Results 91 to 100 of about 55,873 (316)
On the Number of Limit Cycles of a Piecewise Quadratic Near-Hamiltonian System
Abstract and Applied Analysis, 2014 This paper is concerned with the problem for the maximal number of limit cycles for a quadratic piecewise near-Hamiltonian system. By using the method of the first order Melnikov function, we find that it can have 8 limit cycles.
Jing Tian
doaj +1 more source
Constructing Two Edge-Disjoint Hamiltonian Cycles in Locally Twisted Cubes [PDF]
, 2010 The $n$-dimensional hypercube network $Q_n$ is one of the most popular interconnection networks since it has simple structure and is easy to implement. The $n$-dimensional locally twisted cube, denoted by $LTQ_n$, an important variation of the hypercube,
Hung, Ruo-Wei
core
Hamiltonian decompositions of products of cycles
Discrete Mathematics, 1978 AbstractA graph is said to be decomposable into hamiltonian cycles if its edge set can be partitioned into hamiltonian cycles. We show that the cartesian product of any three cycles can be decomposed into three hamiltonian cycles, thus settling a conjecture by Kotzig.
openaire +1 more source
Spin and Charge Control of Topological End States in Chiral Graphene Nanoribbons on a 2D Ferromagnet
Advanced Materials, EarlyView.Chiral graphene nanoribbons on a ferromagnetic gadolinium‐gold surface alloy display tunable spin and charge states at their termini. Atomic work function variations and exchange fields enabe transitions between singlet, doublet, and triplet configurations.
Leonard Edens +8 more
wiley +1 more source
Identifying Hamilton cycles in the Cartesian product of directed cycles
AKCE International Journal of Graphs and Combinatorics, 2020 Let be a Cartesian product of directed cycles. It is known that has a Hamilton cycle if there is a permutation of that satisfies and for some positive integers , where . In addition, if then has two arc-disjoint Hamilton cycles.
Zbigniew R. Bogdanowicz
doaj +1 more source
Cycle spectra of Hamiltonian graphs
Journal of Combinatorial Theory, Series B, 2012 AbstractWe prove that every Hamiltonian graph with n vertices and m edges has cycles with more than p−12lnp−1 different lengths, where p=m−n. For general m and n, there exist such graphs having at most 2⌈p+1⌉ different cycle lengths.
Kevin G. Milans +4 more
openaire +2 more sources
Advanced Materials, EarlyView.We design and implement Au‐Cu co‐modified Zn3In2S6 catalyst with spatially decoupling charge carriers across bulk and surface sites, which effectively suppresses carrier recombination, drives surface hot electron accumulation and stabilizes intermediates for photocatalytic oxygen reduction. The optimized catalyst achieves an H2O2 evolution rate of 94.2
Xiaowen Ruan +10 more
wiley +1 more source
Advanced Materials, EarlyView.A high‐capacity polyimide‐linked porous organic polymer (HAT‐PTO) incorporating numerous redox‐active centers is synthesized via a hydrothermal reaction, delivering a high theoretical capacity of 484 mAh g−1. In situ hybridization with carboxyl‐functionalized multiwalled carbon nanotubes enhances conductivity and stability, achieving 397 mAh g−1 at C ...
Arindam Mal +7 more
wiley +1 more source
Markov chains and optimality of the Hamiltonian cycle [PDF]
, 2007 We consider the Hamiltonian cycle problem (HCP) embedded in a controlled Markov decision process. In this setting, HCP reduces to an optimization problem on a set of Markov chains corresponding to a given graph.
Ejov, Vladimir, Litvak, Nelly
core +1 more source
Effect of Anion Hydrophobicity on the Oxidation of Ferrocene‐Terminated Monolayers
Advanced Theory and Simulations, EarlyView.Self‐assembled monolayers terminated with ferrocene moieties can be oxidized using an applied potential. At the oxidized layer, anions from the electrolyte can form a layer. Experiments show a relationship between the hydrophobicity of the anion species and the redox potential.
Ludwig J.V. Ahrens‐Iwers +2 more
wiley +1 more source