Results 51 to 60 of about 55,873 (316)
The utilization of direct energy deposition (DED)‐arc additive manufacturing processes in industrial applications is increasing, and these processes have the potential for multi‐material applications. This work provides a overview of the state of research in DED‐arc made functional graded structures, to establish a link to potential industrial ...
Kai Treutler, Volker Wesling
wiley +1 more source
Hamiltonian Cycles on Ammann-Beenker Tilings
We provide a simple algorithm for constructing Hamiltonian graph cycles (visiting every vertex exactly once) on a set of arbitrarily large finite subgraphs of aperiodic two-dimensional Ammann-Beenker (AB) tilings.
Shobhna Singh +2 more
doaj +1 more source
A conjecture on the number of Hamiltonian cycles on thin grid cylinder graphs [PDF]
Graph ...
Olga Bodroža-Pantić +2 more
doaj +1 more source
Quantitative Small Subgraph Conditioning [PDF]
We revisit the method of small subgraph conditioning, used to establish that random regular graphs are Hamiltonian a.a.s. We refine this method using new technical machinery for random $d$-regular graphs on $n$ vertices that hold not just asymptotically,
Johnson, Tobias, Paquette, Elliot
core
In this study, the unique role of the unusual lone‐pair‐π conjugation mechanism in poly(1,4‐anthraquinone) (P14AQ) is explored as an organic electrode material. Unlike traditional π‐π interactions, P14AQ's conjugation involves lone pairs of oxygen atoms interacting with the π cloud of adjacent units, enabling stable charge transport even with minimal π‐
Xiaotong Zhang, Piotr de Silva
wiley +1 more source
Matchings Extend to Hamiltonian Cycles in 5-Cube
Ruskey and Savage asked the following question: Does every matching in a hypercube Qn for n ≥ 2 extend to a Hamiltonian cycle of Qn? Fink confirmed that every perfect matching can be extended to a Hamiltonian cycle of Qn, thus solved Kreweras’ conjecture.
Wang Fan, Zhao Weisheng
doaj +1 more source
Hamiltonian cycles in faulty random geometric networks [PDF]
In this paper we analyze the Hamiltonian properties of faulty random networks. This consideration is of interest when considering wireless broadcast networks.
Petit Silvestre, Jordi
core +1 more source
Small cycles, generalized prisms and Hamiltonian cycles in the Bubble-sort graph
The Bubble-sort graph $BS_n,\,n\geqslant 2$, is a Cayley graph over the symmetric group $Sym_n$ generated by transpositions from the set $\{(1 2), (2 3),\ldots, (n-1 n)\}$.
Konstantinova, Elena V. +1 more
core +1 more source
Synchrotron Radiation for Quantum Technology
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
Notes on Hamiltonian threshold and chain graphs
We revisit results obtained in [1], where several necessary and necessary and sufficient conditions for a connected threshold graph to be Hamiltonian were obtained.
Milica Anđelić +2 more
doaj +1 more source

