Results 71 to 80 of about 52,480 (200)
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
Advanced Science, EarlyView.We developed a RhPd‐H nanozyme that integrates enhanced POD‐mimetic catalytic activity with thermally triggered H2 release. H2 shields and reprograms mitochondria to continuously leak endogenous ·O2−. This dual‐path ROS spatially and temporally disrupts redox homeostasis, inducing persistent oxidative stress for tumor suppression and antitumor immunity,
Mingfan Shi +12 more
wiley +1 more source
Hamilton Cycles in Double Generalized Petersen Graphs
Discussiones Mathematicae Graph Theory, 2019 Coxeter referred to generalizing the Petersen graph. Zhou and Feng modified the graphs and introduced the double generalized Petersen graphs (DGPGs). Kutnar and Petecki proved that DGPGs are Hamiltonian in special cases and conjectured that all DGPGs are
Sakamoto Yutaro
doaj +1 more source
Grafos hamiltonianos en el diseño de viajes
Modelling in Science Education and Learning, 2013 The existence and, if applicable, the location of paths with given properties is a topic in graph theory. One of these problems is to find routes through all points, only once, starting and ending at the same node.
Cristina Jordán Lluch +1 more
doaj +1 more source
Efficient Screening of Organic Singlet Fission Molecules Using Graph Neural Networks
Advanced Science, EarlyView.A high‐throughput screening framework based on graph neural networks (GNNs) and multi‐level validation facilitates the identification of singlet fission (SF) candidates. By efficiently predicting excitation energies across 20 million molecules, and integrating TDDFT calculations, synthetic accessibility assessments, and GW+BSE calculations, this ...
Li Fu +5 more
wiley +1 more source
Limit cycle bifurcations in a planar piecewise quadratic system with multiple parameters
Advances in Difference Equations, 2020 This paper is concerned with the number of limit cycles bifurcating from a period annulus for some planar piecewise smooth non-Hamiltonian systems. We construct a planar piecewise quadratic system with multiple parameters, obtain its lower bound for the ...
Shuhua Gong, Maoan Han
doaj +1 more source
Polyhedral graphs without hamiltonian cycles
Discrete Applied Mathematics, 1997 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
Advanced Science, EarlyView.How can Sn‐based anodes achieve high capacity and long‐life cycling? This work unlocks the potential anode structure by confining Sn in the A layer of MAX phase with Ti6C octahedra as outer immobilization and Fe as inner anchors. The introduction of Fe dramatically strengthens the Ti–Sn bond to enhance structural integrity, modulate interfacial ...
Yu‐ang Lei +13 more
wiley +1 more source
Limit Cycles Bifurcated from Some Z4-Equivariant Quintic Near-Hamiltonian Systems
Abstract and Applied Analysis, 2014 We study the number and distribution of limit cycles of some planar Z4-equivariant quintic near-Hamiltonian systems. By the theories of Hopf and heteroclinic bifurcation, it is proved that the perturbed system can have 24 limit cycles with some new ...
Simin Qu +3 more
doaj +1 more source