Results 61 to 70 of about 76,992 (320)
International Journal of Mathematics and Mathematical Sciences, 2001 For an arbitrary undirected graph G, we are designing a logical model for the Hamiltonian Cycle Problem (HCP), using tools of Boolean algebra only. The obtained model is a logic formulation of the conditions for the existence of the Hamiltonian cycle ...
Anatoly D. Plotnikov
doaj +1 more source
A closed -knight’s tour on some cylinder chessboards
AKCE International Journal of Graphs and Combinatorics, 2020 A -knight’s move on the cylinder chessboard is the move of the knight 2 squares vertically or 2 squares horizontally and then 3 squares perpendicular to it.
Sirirat Singhun +2 more
doaj +1 more source
A Distributed algorithm to find Hamiltonian cycles in Gnp random graphs [PDF]
, 2003 In this paper, we present a distributed algorithm to find Hamiltonian cycles in random binomial graphs Gnp. The algorithm works on a synchronous distributed setting by first creating a small cycle, then covering almost all vertices in the graph with ...
Levy, Eythan +2 more
core +1 more source
Synchrotron Radiation for Quantum Technology
Advanced Functional Materials, EarlyView.Materials and interfaces underpin quantum technologies, with synchrotron and FEL methods key to understanding and optimizing them. Advances span superconducting and semiconducting qubits, 2D materials, and topological systems, where strain, defects, and interfaces govern performance.
Oliver Rader +10 more
wiley +1 more source
Hamilton-connectedness and Hamilton-laceability of planar geometric graphs with applications
AIMS Mathematics, 2021 In this paper, we have used two different proof techniques to show the Hamilton-connectedness of graphs. By using the vertex connectivity and Hamiltoniancity of graphs, we construct an infinite family of Hamilton-connected convex polytope line graphs ...
Suliman Khan +4 more
doaj +1 more source
Atomic Size Misfit for Electrocatalytic Small Molecule Activation
Advanced Functional Materials, EarlyView.This review explores the application and mechanisms of atomic size misfit in catalysis for small molecule activation, focusing on how structural defects and electronic properties can effectively lower the energy barriers of chemical bonds in molecules like H2O, CO2, and N2.
Ping Hong +3 more
wiley +1 more source
A Note on Cycles in Locally Hamiltonian and Locally Hamilton-Connected Graphs
Discussiones Mathematicae Graph Theory, 2020 Let 𝒫 be a property of a graph. A graph G is said to be locally 𝒫, if the subgraph induced by the open neighbourhood of every vertex in G has property 𝒫. Ryjáček conjectures that every connected, locally connected graph is weakly pancyclic.
Tang Long, Vumar Elkin
doaj +1 more source
The parity Hamiltonian cycle problem
Discrete Mathematics, 2018 Motivated by a relaxed notion of the celebrated Hamiltonian cycle, this paper investigates its variant, parity Hamiltonian cycle (PHC): A PHC of a graph is a closed walk which visits every vertex an odd number of times, where we remark that the walk may use an edge more than once. First, we give a complete characterization of the graphs which have PHCs,
Yusuke Kobayashi +4 more
openaire +3 more sources
Symmetry Enhanced Unconventional Spin Current Anisotropy in a Collinear Antiferromagnet
Advanced Functional Materials, EarlyView.Spin‐orbit torques (SOTs) are investigated in epitaxial FeSn, a topological antiferromagnet with kagome lattice symmetry. Combining experimental and theoretical approaches, the study identifies a six‐fold conventional damping‐like spin‐orbit torque (DL SOT), along with the coexistence of both six‐fold and uniaxial unconventional field‐like torque (FL ...
Pankhuri Gupta +10 more
wiley +1 more source
On the cycle structure of hamiltonian k-regular bipartite graphs of order 4k [PDF]
, 2009 It is shown that a hamiltonian $n/2$-regular bipartite graph $G$ of order $2n>8$ contains a cycle of length $2n-2$. Moreover, if such a cycle can be chosen to omit a pair of adjacent vertices, then $G$ is bipancyclic.Comment: 3 ...
Adamus, Janusz
core