Results 51 to 60 of about 52,480 (200)
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
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
Small cycles, generalized prisms and Hamiltonian cycles in the Bubble-sort graph
, 2019 The Bubble-sort graph $BS_n,\,n\geqslant 2$, is a Cayley graph over the symmetric group $Sym_n$ generated by transpositions from the set $\{(1 2), (2 3),\ldots, (n-1 n)\}$.
Konstantinova, Elena V. +1 more
core +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
Gapless Superconductivity From Extremely Dilute Magnetic Disorder in 2H‐NbSe2‐xSx
Advanced Materials, EarlyView.We demonstrate that 2H‐NbSe2‐xSx hosts gapless superconductivity at unexpectedly low magnetic impurity concentrations. Combining STM, Bogoliubovde Gennes simulations, DFT, and quasiparticle interference, we comprehensively study the development of gapless behavior and show that SeS substitution reshapes the band structure, enhances nesting, and drives ...
Jose Antonio Moreno +16 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
, 2007 We analyze the problem of discovering long cycles inside a graph. We propose and test two algorithms for this task. The first one is based on recent advances in statistical mechanics and relies on a message passing procedure.
B. Bollobás +18 more
core +1 more source
Strong Plasmon–Exciton Coupling Tuned by Corner Etching of Gold Nanocubes and Nanotriangles
Advanced Optical Materials, EarlyView.Systematic etching of gold nanocubes (AuNCs) and nanotriangles (AuNTs) reveals how nanoparticle morphology governs plasmon–exciton strong coupling. While rounding the corners of AuNCs weakens their coupling, triangular geometries robustly preserve deep strong coupling.
Jiyeon Lee +4 more
wiley +1 more source
Constructing arbitrarily large graphs with a specified number of Hamiltonian cycles
Electronic Journal of Graph Theory and Applications, 2016 A constructive method is provided that outputs a directed graph which is named a broken crown graph, containing $5n-9$ vertices and $k$ Hamiltonian cycles for any choice of integers $n \geq k \geq 4$. The construction is not designed to be minimal in any
Michael Haythorpe
doaj +1 more source
Applicable Analysis and Discrete Mathematics, 2019 In a recent paper, we have studied the enumeration of Hamiltonian cycles (abbreviated HCs) on the grid cylinder graph Pm+1 x Cn, where m grows while n is fixed. In this sequel, we study a much harder problem of enumerating HCs on the same graph only this time letting n grow while m is fixed.
Olga Bodroza-Pantic +4 more
openaire +4 more sources