Results 281 to 290 of about 76,992 (320)

Spin-Electric Effect on a Chiral Dysprosium Complex. [PDF]

J Am Chem Soc
Tacconi L, Cini A, Raza A, Tesi L, Bartolini P, Taschin A, van Slageren J, Briganti M, Sorace L, Fittipaldi M, Perfetti M.   +10 more
europepmc   +1 more source

Realizing the entanglement Hamiltonian of a topological quantum Hall system. [PDF]

Nat Commun
Redon Q, Liu Q, Bouhiron JB, Mittal N, Fabre A, Lopes R, Nascimbene S.   +6 more
europepmc   +1 more source

A tutorial for mesoscale computer simulations of lipid membranes: tether pulling, tubulation and fluctuations.

Soft Matter
Muñoz-Basagoiti M, Frey F, Meadowcroft B, Amaral M, Prada A, Šarić A.   +5 more
europepmc   +1 more source

Some of the next articles are maybe not open access.

Related searches:

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
Paul Erdős, Béla Bollobás
openaire   +2 more sources

The Square of a Hamiltonian Cycle

SIAM Journal on Discrete Mathematics, 1994
All graphs considered in this paper are simple and undirected. For a given graph \(G= (V,E)\) we denote by \(\delta(G)\) the minimum degree of \(G\). A \(k\)-chord of a cycle \(C\) is an edge joining two vertices of distance \(k\) on \(C\). The \(k\)th power of \(C\) is the graph obtained by joining every pair of vertices with distance at most \(k\) on
Roland Haggkvist, Genghua Fan
openaire   +2 more sources

On Hamiltonian cycles and Hamiltonian paths

Information Processing Letters, 2005
A Hamiltonian cycle is a spanning cycle in a graph, i.e., a cycle through every vertex, and a Hamiltonian path is a spanning path. In this paper we present two theorems stating sufficient conditions for a graph to possess Hamiltonian cycles and Hamiltonian paths.
Mohammad Kaykobad, M. Sohel Rahman
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 ...
Martin Lades, Eric Lewin Altschuler, Richard Stong   +2 more
openaire   +2 more sources

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   +3 more sources