Results 51 to 60 of about 77,685 (270)
A Note on Cycles in Locally Hamiltonian and Locally Hamilton-Connected Graphs
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
AIâAssisted Workflow for (Scanning) Transmission Electron Microscopy: From Data Analysis Automation to Materials Knowledge Unveiling. Abstract (Scanning) transmission electron microscopy ((S)TEM) has significantly advanced materials science but faces challenges in correlating precise atomic structure information with the functional properties of ...
Marc Botifoll +19 more
wiley +1 more source
A closed -knightâs tour on some cylinder chessboards
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]
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
Spin and Charge Control of Topological End States in Chiral Graphene Nanoribbons on a 2D Ferromagnet
Chiral graphene nanoribbons on a ferromagnetic gadoliniumâgold surface alloy display tunable spin and charge states at their termini. Atomic work function variations and exchange fields enabe transitions between singlet, doublet, and triplet configurations.
Leonard Edens +8 more
wiley +1 more source
The One-Fault Directed Dimension-Balanced Hamiltonian Problem in Directed Toroidal Mesh Graphs
Hamiltonian cycle problems play a central role in graph theory and have wide-ranging applications in network-on-chip architectures, interconnection networks, and large-scale parallel systems.
Yancy Yu-Chen Chang, Justie Su-Tzu Juan
doaj +1 more source
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
On Hamiltonian Cycles in Claw-Free Cubic Graphs
We show that every claw-free cubic graph of order n at least 8 has at most 2ân4â{2^{\left\lfloor {{n \over 4}} \right\rfloor }} Hamiltonian cycles, and we also characterize all extremal graphs.
Mohr Elena, Rautenbach Dieter
doaj +1 more source
On pedigree polytopes and Hamiltonian cycles
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +3 more sources
Magnetic doping of the topological insulator Bi2Te3 with erbium adatoms induces outâofâplane magnetism and breaks timeâreversal symmetry, opening a Dirac gap and driving a Fermi surface transition from hexagonal to starâofâDavid geometry. Microscopy, spectroscopy, and magnetic dichroism reveal atomically controlled magnetic interactions that tailor the
Beatriz Muñiz Cano +18 more
wiley +1 more source

