Results 81 to 90 of about 889,165 (240)

4-regular 4-connected Hamiltonian graphs with a bounded number of Hamiltonian cycles

open access: yes, 2021
We prove that there exists an infinite family of 4-regular 4-connected Hamiltonian graphs with a bounded number of Hamiltonian cycles. We do not know whether there exists such a family of 5-regular 5-connected Hamiltonian graphs.
Zamfirescu, Carol   +2 more
core  

Molecular Rectification: Mechanisms, Modulation Strategies, and Device Realization

open access: yesAdvanced Science, EarlyView.
This review focuses on molecular rectification, from its fundamental mechanisms and modulation strategies to device realization. It summarizes the theoretical framework, modulation strategies, fabrication techniques, characterization methods, and modeling and simulation of molecular rectifiers, while discussing challenges and future directions for ...
Junnan Guo   +8 more
wiley   +1 more source

Identifying Hamilton cycles in the Cartesian product of directed cycles

open access: yesAKCE 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

Limit cycle bifurcations in a planar piecewise quadratic system with multiple parameters

open access: yesAdvances in Difference Equations, 2020
This paper is concerned with the number of limit cycles bifurcating from a period annulus for some planar piecewise smooth non-Hamiltonian systems. We construct a planar piecewise quadratic system with multiple parameters, obtain its lower bound for the ...
Shuhua Gong, Maoan Han
doaj   +1 more source

On pre-Hamiltonian Cycles in Hamiltonian Digraphs [PDF]

open access: yes, 2014
Let $D$ be a strongly connected directed graph of order $n\geq 4$. In \cite{[14]} (J. of Graph Theory, Vol.16, No. 5, 51-59, 1992) Y. Manoussakis proved the following theorem: Suppose that $D$ satisfies the following condition for every triple $x,y,z$ of vertices such that $x$ and $y$ are non-adjacent: If there is no arc from $x$ to $z$, then $d(x)+d(y)
openaire   +2 more sources

Sliding Ferroelectric Metals: An Emerging Frontier

open access: yesAdvanced Science, EarlyView.
This Perspective highlights recent advances in sliding ferroelectric metals, focusing on the coexistence of switchable polarization and metallicity. Representative nonmagnetic and magnetic systems are discussed, together with Berry‐curvature memory, superconducting switching, triply‐coupled switching, magnetoelectric coupling, and electrically ...
Ying Yang   +3 more
wiley   +1 more source

Limit Cycles Bifurcated from Some Z4-Equivariant Quintic Near-Hamiltonian Systems

open access: yesAbstract and Applied Analysis, 2014
We study the number and distribution of limit cycles of some planar Z4-equivariant quintic near-Hamiltonian systems. By the theories of Hopf and heteroclinic bifurcation, it is proved that the perturbed system can have 24 limit cycles with some new ...
Simin Qu   +3 more
doaj   +1 more source

Magnetoelectric Multiferroics for the Next‐Generation Ultralow‐Power Electronics

open access: yesAdvanced Science, EarlyView.
Magnetoelectric coupling provides a unifying route from electric‐field control of magnetic order to non‐volatile MeRAM, MESO logic, and emerging antiferromagnetic and magnonic devices. By connecting switching physics with device benchmarks, material platforms, and integration strategies, distinctive technological opportunities are identified alongside ...
Yang Liu   +13 more
wiley   +1 more source

On the Number of Limit Cycles of a Piecewise Quadratic Near-Hamiltonian System

open access: yesAbstract 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

Home - About - Disclaimer - Privacy