Results 101 to 110 of about 889,165 (240)

Hamiltonian cycles in I–graphs

Electronic Notes in Discrete Mathematics, 2013
Abstract The I–graphs generalize the family of generalized Petersen graphs. We show that a connected I–graph which is not a generalized Petersen graph is Hamiltonian.
BONVICINI, Simona, Pisanski, Tomaž
openaire   +3 more sources

Counting Hamiltonian cycles in quartic circulant graphs [PDF]

We consider the problem of counting Hamiltonian cycles in circulant graphs $C_n^{1,k}$. Our method is to partition the set of Hamiltonian cycles according to their winding numbers.
Hilliard, Allison
core  

Prediction of Structural Stability of Layered Oxide Cathode Materials: Combination of Machine Learning and Ab Initio Thermodynamics

Advanced Energy Materials, EarlyView.
In this work, we developed a phase‐stability predictor by combining machine learning and ab initio thermodynamics approaches, and identified the key factors determining the favorable phase for a given composition. Specifically, a lower TM ionic potential, higher Na content, and higher mixing entropy favor the O3 phase.
Liang‐Ting Wu, Milica Zdravković, Dijana Milosavljević, Konstantin Köster, Olivier Guillon, Jyh‐Chiang Jiang, Payam Kaghazchi   +6 more
wiley   +1 more source

The S-Hamiltonian Cycle Problem

CoRR
Determining if an input undirected graph is Hamiltonian, i.e., if it has a cycle that visits every vertex exactly once, is one of the most famous NP-complete problems. We consider the following generalization of Hamiltonian cycles: for a fixed set $S$ of natural numbers, we want to visit each vertex of a graph $G$ exactly once and ensure that any two ...
Amarilli, Antoine, Lombardo, Arthur, Monet, Mikaël   +2 more
openaire   +4 more sources

QAOA on Hamiltonian Cycle problem

CoRR, 2023
I use QAOA to solve the Hamiltonian Circle problem. First, inspired by Lucas, I define the QUBO form of Hamiltonian Cycle and transform it to a quantum circuit by embedding the problem of $n$ vertices to an encoding of $(n-1)^2$ qubits. Then, I calcluate the spectrum of the cost hamiltonian for both triangle case and square case and justify my ...
openaire   +3 more sources

Linear Hamiltonian behaviors and bilinear differential forms [PDF]

, 2004
We study linear Hamiltonian systems using bilinear and quadratic differential forms. Such a representation-free approach allows us to use the same concepts and techniques to deal with systems isolated from their environment and with systems subject to ...
Rapisarda, P., Trentelman, H.L., Rapisarda, P, Trentelman, HL, Rapisarda, Paolo, Trentelman, Harry L.   +5 more
core   +1 more source

Evolution of Physical Intelligence Across Scales

Advanced Intelligent Discovery, EarlyView.
By following the evolution of physical intelligence across scales, this article shows how intelligence arises from materials, structures, physical interactions, and collectives. It establishes physical intelligence as the evolutionary foundation upon which embodied intelligence is built.
Ke Liu, Tianyun Huang, Aming Li, Pengyu Lv, Tingting Qin, Wenhui Chen, Hui Wei, Huiling Duan   +7 more
wiley   +1 more source

On hyper-Hamiltonian Cartesian product of undirected cycles [PDF]

Discrete Mathematics Letters, 2021
Zbigniew R. Bogdanowicz
doaj   +1 more source

Arc-Disjoint Hamiltonian Cycles in Round Decomposable Locally Semicomplete Digraphs

Discussiones Mathematicae Graph Theory, 2018
Let D = (V,A) be a digraph; if there is at least one arc between every pair of distinct vertices of D, then D is a semicomplete digraph. A digraph D is locally semicomplete if for every vertex x, the out-neighbours of x induce a semicomplete digraph and ...
Li Ruijuan, Han Tingting
doaj   +1 more source

A note on edge-disjoint contractible Hamiltonian cycles in polyhedral maps

Electronic Journal of Graph Theory and Applications, 2014
We present a necessary and sufficient condition for existence of edge-disjoint contractible Hamiltonian Cycles in the edge graph of polyhedral maps.
Ashish K Upadhyay, Dipendu Maity
doaj   +1 more source