Results 51 to 60 of about 77,334 (248)
A Distributed algorithm to find Hamiltonian cycles in Gnp random graphs [PDF]
, 2003 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
Advanced Materials, EarlyView.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
A closed -knight’s tour on some cylinder chessboards
AKCE International Journal of Graphs and Combinatorics, 2020 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
Advanced Materials, EarlyView.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
Hamiltonian chordal graphs are not cycle extendible [PDF]
, 2014 In 1990, Hendry conjectured that every Hamiltonian chordal graph is cycle extendible; that is, the vertices of any non-Hamiltonian cycle are contained in a cycle of length one greater.
Lafond, Manuel, Seamone, Ben
core
The One-Fault Directed Dimension-Balanced Hamiltonian Problem in Directed Toroidal Mesh Graphs
Applied SciencesHamiltonian 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
International Journal of Mathematics and Mathematical Sciences, 2001 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
Discussiones Mathematicae Graph Theory, 2022 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
Advanced Materials, EarlyView.A high‐capacity polyimide‐linked porous organic polymer (HAT‐PTO) incorporating numerous redox‐active centers is synthesized via a hydrothermal reaction, delivering a high theoretical capacity of 484 mAh g−1. In situ hybridization with carboxyl‐functionalized multiwalled carbon nanotubes enhances conductivity and stability, achieving 397 mAh g−1 at C ...
Arindam Mal +7 more
wiley +1 more source
A Survey on Hamiltonian Cycles
Interdisciplinary Information Sciences, 2001 The author surveys some of the classical results on Hamiltonian cycles in undirected graphs and pays particular attention to the development over the last decade. Among the subjects are: binding number, toughness, degree conditions, closure, regular graphs, and graphs on surfaces. This is intended as a supplement to the survey of \textit{R. J.
openaire +3 more sources