Results 41 to 50 of about 3,188,937 (280)
The parity Hamiltonian cycle problem
Discrete Mathematics, 2018 Motivated by a relaxed notion of the celebrated Hamiltonian cycle, this paper investigates its variant, parity Hamiltonian cycle (PHC): A PHC of a graph is a closed walk which visits every vertex an odd number of times, where we remark that the walk may use an edge more than once. First, we give a complete characterization of the graphs which have PHCs,
Nishiyama, Hiroshi +4 more
openaire +3 more sources
Removable matchings and hamiltonian cycles
Discrete Mathematics, 2009 The authors show the following two results: {\parindent=5mm \begin{itemize}\item[1)]Let \(G\) be a graph of order \(n\geq 4k+3\) with \(\sigma_2 (G)\geq n\) and let \(F\) be a matching of size \(k\) in \(G\) such that \(G-F\) is 2-connected. Then \(G-F\) is hamiltonian or \(G\cong K_2 +(K_2\cup K_{n-4})\) or \(G\cong \bar{K_2} +(K_2\cup K_{n-4 ...
Hu, Zhiquan, Li, Hao
openaire +1 more source
Alternating Hamiltonian cycles in 2-edge-colored multigraphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2018 A path (cycle) in a $2$-edge-colored multigraph is alternating if no two consecutive edges have the same color. The problem of determining the existence of alternating Hamiltonian paths and cycles in $2$-edge-colored multigraphs is an $\mathcal{NP ...
Alejandro Contreras-Balbuena +2 more
semanticscholar +1 more source
Synchrotron Radiation for Quantum Technology
Advanced Functional Materials, EarlyView.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
Hamiltonian cycles in faulty random geometric networks [PDF]
, 2001 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
Perfect matchings and Hamiltonian cycles in the preferential attachment model [PDF]
Random Struct. Algorithms, 2016 In this paper, we study the existence of perfect matchings and Hamiltonian cycles in the preferential attachment model. In this model, vertices are added to the graph one by one, and each time a new vertex is created it establishes a connection with m ...
A. Frieze +3 more
semanticscholar +1 more source
Atomic Size Misfit for Electrocatalytic Small Molecule Activation
Advanced Functional Materials, EarlyView.This review explores the application and mechanisms of atomic size misfit in catalysis for small molecule activation, focusing on how structural defects and electronic properties can effectively lower the energy barriers of chemical bonds in molecules like H2O, CO2, and N2.
Ping Hong +3 more
wiley +1 more source
Quantitative Small Subgraph Conditioning [PDF]
, 2015 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
Minimum vertex degree condition for tight Hamiltonian cycles in 3‐uniform hypergraphs [PDF]
Proceedings of the London Mathematical Society, 2016 We show that every 3‐uniform hypergraph with n vertices and minimum vertex degree at least (5/9+o(1))n2 contains a tight Hamiltonian cycle. Known lower bound constructions show that this degree condition is asymptotically optimal.
Christian Reiher +4 more
semanticscholar +1 more source
Advanced Functional Materials, EarlyView.This study demonstrates coherent control of 15N nuclear spins coupled to VB−${\text{V}}_{\text{B}}^{-}$ centers in isotope‐enriched hexagonal boron nitride. Selective addressing via spin‐state mixing enables Rabi driving, quantum gates, and coherence times exceeding 10 μs$\umu{\rm s}$.
Adalbert Tibiássy +6 more
wiley +1 more source