Results 61 to 70 of about 3,678 (251)
On reciprocal degree distance of graphs
Heliyon, 2023 Given a connected graph H, its reciprocal degree distance is defined asRDD(H)=∑x≠ydH(vx)+dH(vy)dH(vx,vy), where dH(vx) denotes the degree of the vertex vx in the graph H and dH(vx,vy) is the shortest distance between vx and vy in H.
Mingqiang An +3 more
doaj +1 more source
A note on K-path hamiltonian graphs
, 1969 A graph G on p vertices is k-path Hamiltonian if every path of length not exceeding k, 1≤k≤p−2, is contained in a Hamiltonian cycle of G.
Kronk, Hudson V.
core +1 more source
Proper Hamiltonian Paths in Edge-Coloured Multigraphs [PDF]
Graphs and Combinatorics, 2011 Given a $c$-edge-coloured multigraph, a proper Hamiltonian path is a path that contains all the vertices of the multigraph such that no two adjacent edges have the same colour. In this work we establish sufficient conditions for an edge-coloured multigraph to guarantee the existence of a proper Hamiltonian path, involving various parameters as the ...
Raquel Águeda +5 more
openaire +6 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
Hamiltonian paths through two- and three-dimensional grids
, 2005 This paper addresses the existence of Hamiltonian paths and cycles in two-dimensional grids consisting of triangles or quadrilaterals, and three-dimensional grids consisting of tetrahedra or hexahedra. The paths and cycles may be constrained to pass from
Mitchell, W.F.
core +1 more source
Bayesian Adaptive Hamiltonian Monte Carlo with an Application to High-Dimensional BEKK GARCH Models [PDF]
Hamiltonian Monte Carlo (HMC) is a recent statistical procedure to sample from complex distributions. Distant proposal draws are taken in a equence of steps following the Hamiltonian dynamics of the underlying parameter space, often yielding superior ...
John Maheu, Martin Burda
core +2 more sources
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
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
, 2012 Figure from Adleman 1994 (5). In the pictured directed graph, there is a unique Hamiltonian path from vertex 0 to vertex 6: 0123456.
Barbara Bryant (166998)
core +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