Results 271 to 280 of about 78,303 (310)

Hamiltonian Cycles on Ammann-Beenker Tilings

Shobhna Singh, Jerome Lloyd, Felix Flicker   +2 more
openalex   +1 more source

Native multi-qubit gates in transmon qubits via synchronous driving. [PDF]

Sci Rep
Pratapsi SS, Cruz D, André P.
europepmc   +1 more source

Some of the next articles are maybe not open access.

Related searches:

On Hamiltonian cycles and Hamiltonian paths

Information Processing Letters, 2005
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Rahman, M. Sohel, Kaykobad, M.
openaire   +1 more source

Alternating Hamiltonian cycles

Israel Journal of Mathematics, 1976
For natural numbers \(n\) and \(d\), let \(K_n(\Delta_c \leq d)\) denote a complete graph of order \(n\) whose edges are colored so that no vertex belongs to more than \(d\) edges of the same color, and where \(\Delta_c\) is the maximal degree in the subgraph formed by the edges of color \(c\). D. E. Daykin proved that if \(d=2\) and \(n \geq 6\), then
Bollobás, Béla, Erdős, Paul
openaire   +1 more source

Finding Hamiltonian Cycles

Science, 1996
L. Adleman has proposed and demonstrated a highly novel approach using DNA and the tools of molecular biology to solve the famous Hamiltonian cycle problem (HCP) of computer science: Given a directed graph on N vertices ( N cities and a set of R ≤ N 2 one-way roads connecting the cities), does there exist a subset of the roads in which a tour of the ...
Eric Lewin Altschuler, Martin Lades, Richard Stong   +2 more
openaire   +1 more source

Hamiltonian Cycles and Markov Chains

Mathematics of Operations Research, 1994
In this paper we derive new characterizations of the Hamiltonian cycles of a directed graph, and a new LP-relaxation of the Traveling Salesman Problem. Our results are obtained via an embedding of these combinatorial optimization problems in suitably perturbed controlled Markov chains.
Filar, JA, Krass, D
openaire   +3 more sources

Detecting Hamiltonian cycles

Applied Mathematics and Computation, 1992
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +2 more sources

Hamiltonian Cycles of Adjacent Triples

Studies in Applied Mathematics, 1980
A construction is given for ordering triples chosen from an ordered set of elements, so that each triple agrees with each neighbor in two of its members and has third member that is a neighbor of its neighbor's third member. Neighbors here are adjacent in order, and also the first is neighbor to the last among both elements and triples.
openaire   +1 more source

A Remark on Hamiltonian Cycles

Mathematische Nachrichten, 1992
AbstractLet G be an undirected and simple graph on n vertices. Let ω, α and χ denote the number of components, the independence number and the connectivity number of G. G is called a 1‐tough graph if ω(G – S) ⩽ |S| for any subset S of V(G) such that ω(G − S) > 1.
openaire   +2 more sources