The Color Number of Cubic Graphs Having a Spanning Tree with a Bounded Number of Leaves
The color number c(G) of a cubic graph G is the minimum cardinality of a color class of a proper 4-edge-coloring of G. It is well-known that every cubic graph G satisfies c(G) = 0 if G has a Hamiltonian cycle, and c(G) ≤ 2 if G has a Hamiltonian path. In
Analen Malnegro +2 more
doaj +1 more source
Emergent Spin Supersolids in Frustrated Quantum Materials
This review highlights developments in the study of spin super‐solids in frustrated quantum materials. Advanced experimental characterizations and computational studies enable a comprehensive understanding of the driving mechanisms of spin super‐solidity in various layered transition‐metal compounds, bridging materials, experiments, and theory aspects.
Yixuan Huang +2 more
wiley +1 more source
On Hamiltonian Paths and Cycles in Sufficiently Large Distance Graphs [PDF]
Graph ...
Christian Löwenstein +2 more
doaj +1 more source
Backtracking Algorithms for Constructing the Hamiltonian Decomposition of a 4-regular Multigraph
We consider a Hamiltonian decomposition problem of partitioning a regular graph into edge-disjoint Hamiltonian cycles. It is known that verifying vertex non-adjacency in the 1-skeleton of the symmetric and asymmetric traveling salesperson polytopes is an
Alexander V. Korostil +1 more
doaj +1 more source
Graphs with many hamiltonian paths
A graph is \emph{hamiltonian-connected} if every pair of vertices can be connected by a hamiltonian path, and it is \emph{hamiltonian} if it contains a hamiltonian cycle. We construct families of non-hamiltonian graphs for which the ratio of pairs of vertices connected by hamiltonian paths to all pairs of vertices approaches 1. We then consider minimal
Carlson, Erik +5 more
openaire +3 more sources
Probing Near‐Field EM Fluctuations in Superparamagnetic CoFeB With NV Quantum Dephasometry
We non‐invasively investigate the superparamagnetic spin dynamics of a 1.1 nm CoFeB layer by probing its near‐field EM fluctuations using NV centers‐based quantum dephasometry. Our findings are further supported by theoretical modeling and SQUID‐based magnetization characterization. These results provide critical insight into the magnetization dynamics
Shoaib Mahmud +5 more
wiley +1 more source
Hamiltonian Paths in Some Classes of Grid Graphs
The Hamiltonian path problem for general grid graphs is known to be NP-complete. In this paper, we give necessary and sufficient conditions for the existence of Hamiltonian paths in L-alphabet, C-alphabet, F-alphabet, and E-alphabet grid graphs.
Fatemeh Keshavarz-Kohjerdi +1 more
doaj +1 more source
Robust and Safe Autonomous Navigation for Systems With Learned SE(3) Hamiltonian Dynamics
Stability and safety are critical properties for successful deployment of automatic control systems. As a motivating example, consider autonomous mobile robot navigation in a complex environment. A control design that generalizes to different operational
Zhichao Li, Thai Duong, Nikolay Atanasov
doaj +1 more source
The Importance of Metal‐Organic Framework Linker Atoms for CO2 Reduction: A DFT Study
Using DFT, we examine the role of linker atoms in CO2 reduction on copper‐based metal organic frameworks (Cu MOFs). Our calculations reveal that linker atoms may serve as both CO2 and H‐shuttling sites and suggest linker electrostatics as a descriptor for linker activity. ABSTRACT Although the metal within the secondary building unit of a metal‐organic
Ugochukwu Nwosu, Samira Siahrostami
wiley +1 more source
MetalCenter‐Dependent Selectivity Divergence in MN4 Single‐Atom Catalysts for Aerobic HMF Oxidation
Two single‐atom catalysts with M‐N4 configurations (FeN4 and CoN4) were developed for selective HMF oxidation. FeN4 achieves 93.9% selectivity toward FFCA via superoxide anions (O2•−), while CoN4 preferentially produces FDCA through hydroxyl radicals (•OH). DFT calculations reveal that distinct adsorption energies and charge redistribution at the metal
Haoyu Wang +6 more
wiley +1 more source

