Results 71 to 80 of about 77,334 (248)
On $2$-pyramidal Hamiltonian cycle systems [PDF]
Bulletin of the Belgian Mathematical Society - Simon Stevin, 2014 Let \(\hat K_{2n}\) denote the complete graph \(K_{2n}\) with the edges in a perfect matching removed and let \(\hat K_{2n+1} = K_{2n+1}\). A Hamiltonian cycle system (HCS) of order \(v\) is a decomposition of the edge set of \(\hat K_v\) into a disjoint union of Hamiltonian cycles. Such a system \(H\) is called 1-rotational (resp.
Bailey, Rosemary +3 more
openaire +6 more sources
Unveiling a Bulk WTaV Multicomponent Alloy With Superior Thermal Properties and Manufacturability
Advanced Science, EarlyView.ABSTRACT Many tungsten (W)‐based medium and high entropy alloys (HEA) demonstrate superior microstructural stability and enhanced mechanical properties as compared to pure W, effectively rendering them as viable candidate materials for extreme environments such as nuclear fusion, aerospace applications, and so on.
Ishtiaque K. Robin +11 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
On the Hamiltonian Number of a Plane Graph
Discussiones Mathematicae Graph Theory, 2019 The Hamiltonian number of a connected graph is the minimum of the lengths of the closed spanning walks in the graph. In 1968, Grinberg published a necessary condition for the existence of a Hamiltonian cycle in a plane graph, formulated in terms of the ...
Lewis Thomas M.
doaj +1 more source
Hamiltonian cycles on random Eulerian triangulations [PDF]
Nuclear Physics B, 1999 22 pages, 9 figures, references and a comment ...
Guitter, E. +2 more
openaire +4 more sources
Superradiance and Broadband Emission Driving Fast Electron Dephasing in Open Quantum Systems
Advanced Science, EarlyView.We uncover the physical origin of ultrafast electron dephasing in solid‐state high‐harmonic generation by simulating the Lindblad equation for the dissipative Hubbard model. Coexistence of Dicke superradiance and broadband emission is revealed, whose destructive interference shortens the effective scattering time and provides a unified picture of ...
Gimin Bae, Youngjae Kim, Jae Dong Lee
wiley +1 more source
Subgraphs intersecting any hamiltonian cycle
Journal of Combinatorial Theory, Series B, 1988 Let G be a subgraph of K(n), the complete graph on n vertices, such that (i) its edges cannot be represented by fewer than k vertices, (ii) every hamiltonian cycle of K(n) contains at least one edge of G and no proper subgraph of G has this property. P. Erdős posed the question of determining min e(G).
openaire +1 more source
MetalCenter‐Dependent Selectivity Divergence in MN4 Single‐Atom Catalysts for Aerobic HMF Oxidation
Advanced Science, EarlyView.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
Local properties of graphs that induce global cycle properties [PDF]
Opuscula MathematicaA graph \(G\) is locally Hamiltonian if \(G[N(v)]\) is Hamiltonian for every vertex \(v\in V(G)\). In this note, we prove that every locally Hamiltonian graph with maximum degree at least \(|V(G)| - 7\) is weakly pancyclic.
Yanyan Wang, Xiaojing Yang
doaj +1 more source
2-Connected Hamiltonian Claw-Free Graphs Involving Degree Sum of Adjacent Vertices
Discussiones Mathematicae Graph Theory, 2020 For a graph H, define σ¯2(H)=min{d(u)+d(v)|uv∈E(H)}{{\bar \sigma }_2} ( H ) = \min \left\{ {d ( u ) + d ( v )|uv \in E ( H )} \right\} . Let H be a 2-connected claw-free simple graph of order n with δ(H) ≥ 3. In [J. Graph Theory 86 (2017) 193–212], Chen
Tian Tao, Xiong Liming
doaj +1 more source