Decomposition of Regular Bipartite Graphs Into Hamiltonian Cycles (Paths) and S3
Let G be either a complete bipartite graph with n (even) vertices in each partite or a complete bipartite graph with n (odd) vertices in each partite plus a 1‐factor.
null V. Nalini, null S. Jeevadoss
doaj +1 more source
Tree graph representation of hamiltonian paths
A Hamiltonian path of faces of a polyhedron consists of a sequence of adjacent faces which contains each face exactly once. This paper compares by using tree diagrams the Hamiltonian itineraries versus all possible itineraries of adjacent faces of the five regular polyhedrons. The graphs for the tetrahedron, octahedron and icosahedron are binary trees.
openaire +2 more sources
A triangular double‐decker Ni6 complex self‐assembles from Ni(II), TMEDA, and a triphenylene tris dioxolene non‐innocent ligand, with two face‐to‐face tris‐semiquinone decks held by a strong covalent C─C interaction. This rigid scaffold delivers four reversible ligand‐centered redox events: oxidation switches on an intense near‐infrared band and ...
Aristide Colin +12 more
wiley +1 more source
Free Energies of Reaction for Aqueous Glycine Condensation Chemistry at Extreme Temperatures
This book is Open Access. A digital copy can be downloaded for free from Wiley Online Library.
Explores the behavior of carbon in minerals, melts, and fluids under extreme conditions
Carbon trapped in diamonds and carbonate-bearing rocks in subduction zones are examples of the continuing exchange of substantial carbon ...
Matthew Kroonblawd, Nir Goldman
wiley +1 more source
Matching Lagrangian and Hamiltonian simulations in (2+1)-dimensional U(1) gauge theory
At finite lattice spacing, Lagrangian and Hamiltonian predictions differ due to discretization effects. In the Hamiltonian limit, i.e. at vanishing temporal lattice spacing $$a_t$$ a t , the path integral approach in the Lagrangian formalism reproduces ...
C. F. Groß +6 more
doaj +1 more source
On k-path hamiltonian line-graphs
La nota riguarda principalmente i grafi di linee k-path hamiltoniani. Si indicano delle proprietà del grafo di linee di un grafo k-path hamiltoniano e si assegnano delle condizioni sufficienti affinché il grafo di linee di un grafo sia k-path ...
Zamfirescu, Tudor
core
Quenching the Hubbard Model: Comparison of Nonequilibrium Green's Function Methods
ABSTRACT We benchmark nonequilibrium Green's function (NEGF) approaches for interaction quenches in the half‐filled Fermi–Hubbard model in one and two dimensions. We compare fully self‐consistent two‐time Kadanoff–Baym equations (KBE), the generalized Kadanoff–Baym ansatz (GKBA), and the recently developed NEGF‐based quantum fluctuations approach (NEGF‐
Jan‐Philip Joost +3 more
wiley +1 more source
ABSTRACT The properties of plasmas in the low‐density limit are described by virial expansions. Analytical expressions are known for the lowest virial coefficients from Green's function approaches. Recently, accurate path‐integral Monte Carlo (PIMC) simulations were performed for the hydrogen plasma at low densities by Filinov and Bonitz (Phys. Rev.
Gerd Röpke +3 more
wiley +1 more source
ABSTRACT Ab initio path integral Monte Carlo (PIMC) simulations constitute the gold standard for the estimation of a broad range of equilibrium properties of a host of interacting quantum many‐body systems spanning a broad range of conditions from ultracold atoms to warm dense quantum plasmas.
Paul Hamann +2 more
wiley +1 more source
Lumped Approximation of a Transmission Line with an Alternative Geometric Discretization [PDF]
An electromagnetic one-dimensional transmission line represented in a distributed port-Hamiltonian form is lumped into a chain of subsystems which preserve the port-Hamiltonian structure with inputs and outputs in collocated form.
Scherpen, Jacquelien M.A., +3 more
core +1 more source

