Results 61 to 70 of about 1,982,910 (295)
On Uniquely Hamiltonian Claw-Free and Triangle-Free Graphs
Discussiones Mathematicae Graph Theory, 2015 A graph is uniquely Hamiltonian if it contains exactly one Hamiltonian cycle. In this note, we prove that claw-free graphs with minimum degree at least 3 are not uniquely Hamiltonian.
Seamone Ben
doaj +1 more source
Advanced Materials, EarlyView.Co1/3TaS2${\rm Co}_{1/3}{\rm TaS}_{2}$ hosts a triple‐Q noncoplanar antiferromagnetic state with coexisting Z3${\rm Z}_3$ electronic nematicity. We report rotational hysteresis observed in both magnetoresistance and magnetic torque, revealing strongly pinned in‐plane weak ferromagnetic moments in the triple‐Q phase and the magnetism‐driven nature of ...
Joonyoung Choi +5 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
Moiré‐Induced Symmetry Breaking of Charge Order in van der Waals Heterostructures
Advanced Materials, EarlyView.A uniaxial moiré potential in misfit (MS)1+δTaS2 heterostructures selectively reshape charge order: the embedded 1H‐TaS2 layer hosts an incommensurate charge‐density wave, fragmented into nanometer domains and stripped of threefold symmetry. Superconductivity, however, remains uniform and fully gapped, revealing heterosymmetry stacking as a selective ...
Sandra Sajan +12 more
wiley +1 more source
Weakly Dimension-Balanced Hamiltonian Cycle on Three-Dimensional Toroidal Mesh Graph
Engineering ProceedingsThe dimension-balanced cycle (DBC) problem is new in graph theory, with applications such as 3D stereogram reconstruction. In a graph whose edges are partitioned into k dimensions, a cycle is dimension-balanced if edge counts across dimensions differ by ...
Chia-Pei Chu, Justie Su-Tzu Juan
doaj +1 more source
On pedigree polytopes and Hamiltonian cycles
Discrete Mathematics, 2003 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +5 more sources
Advanced Materials, EarlyView.Applied here for the first time to a 2D material, high‐resolution synchrotron x‐ray Fourier transform holography directly images topological spin textures in Fe3GeTe2. Combined with atomistic tight‐binding simulations including itinerant electrons and Rashba spin‐orbit coupling, the approach reveals labyrinth, skyrmion, and mixed phases, and uncovers ...
Sourav Chowdhury +16 more
wiley +1 more source
Generalized honeycomb torus is Hamiltonian
, 2004 Generalized honeycomb torus is a candidate for interconnection network architectures, which includes honeycomb torus, honeycomb rectangular torus, and honeycomb parallelogramic torus as special cases. Existence of Hamiltonian cycle is a basic requirement
Yang, X. +3 more
core +2 more sources
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