Results 61 to 70 of about 158,681 (246)
Hamiltonian Properties of DCell Networks
, 2015 DCell has been proposed for data centers as a server centric interconnection network structure. DCell can support millions of servers with high network capacity by only using commodity switches.
Erickson, Alejandro +3 more
core +1 more source
Chromatic Roots and Hamiltonian Paths
Journal of Combinatorial Theory, Series B, 2000 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
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
Absolute Differences Along Hamiltonian Paths
The Electronic Journal of Combinatorics, 2015 We prove that if the vertices of a complete graph are labeled with the elements of an arithmetic progression, then for any given vertex there is a Hamiltonian path starting at this vertex such that the absolute values of the differences of consecutive vertices along the path are pairwise distinct.
openaire +3 more sources
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
On coefficients of path polynomials
International Journal of Mathematics and Mathematical Sciences, 1984 Explicit formulae, in terms of sugraphs of the graph, are given for the first six coefficients of the simple path polynomial of a graph. From these, explicit formulae are deduced for the number of hamiltonian paths in graphs with up to six nodes.
E. J. Farrell
doaj +1 more source
A DP Approach to Hamiltonian Path Problem [PDF]
, 2013 A Dynamic Programming based polynomial worst case time and space algorithm is described for computing Hamiltonian Path of a directed graph. Complexity constructive proofs along with a tested C++ implementation are provided as well. The result is obtained
Nuriyev, Dmitriy
core
Advanced Science, EarlyView.First‐principles calculations reveal that monolayer In2O${\rm In}_2{\rm O}$ hosts type‐II Dirac fermions near the Fermi level, which split into Weyl points under spin‐orbit coupling. The material exhibits negative and giant magnetoresistance, a pronounced spin Hall effect, and phonon‐mediated superconductivity at 1.5 K, establishing it as a unique ...
Qing‐Bo Liu +6 more
wiley +1 more source
On the Edge-Hyper-Hamiltonian Laceability of Balanced Hypercubes
Discussiones Mathematicae Graph Theory, 2016 The balanced hypercube BHn, defined by Wu and Huang, is a variant of the hypercube network Qn, and has been proved to have better properties than Qn with the same number of links and processors.
Cao Jianxiang, Shi Minyong, Feng Lihua
doaj +1 more source
Forbidden subgraphs that imply Hamiltonian-connectedness [PDF]
, 1999 It is proven that if $G$ is a $3$-connected claw-free graph which is also $Z_3$-free (where $Z_3$ is a triangle with a path of length $3$ attached), $P_6$-free (where $P_6$ is a path with $6$ vertices) or $H_1$-free (where $H_1$ consists of two disjoint ...
Broersma, H.J. +4 more
core +2 more sources