Results 111 to 120 of about 55,873 (316)
The Hamiltonian and Hypohamiltonian of Generalized Petersen Graph (GP_(n,9))
Jambura Journal of MathematicsThe study of Hamiltonian and Hypohamiltonian properties in the generalized Petersen graph GP_{n,k} is interesting due to the unique structure and characteristics of these graphs. The method employed in this study involves searching for Hamiltonian cycles
Susilawati Susilawati +3 more
doaj +1 more source
An Implicit Weighted Degree Condition For Heavy Cycles
Discussiones Mathematicae Graph Theory, 2014 For a vertex v in a weighted graph G, idw(v) denotes the implicit weighted degree of v. In this paper, we obtain the following result: Let G be a 2-connected weighted graph which satisfies the following conditions: (a) The implicit weighted degree sum of
Cai Junqing, Li Hao, Ning Wantao
doaj +1 more source
Millikelvin Intracellular Nanothermometry with Nanodiamonds
Advanced Science, EarlyView.Nanothermometry in living cells is crucial for understanding heat diffusion and advancing cellular biology and drug discovery. Previous studies have reported controversial intracellular temperature variations. Using nanodiamond nanothermometry in macrophages, it is found that, in such experimental setting, apparent temperature changes are actually due ...
Maabur Sow +26 more
wiley +1 more source
Decomposing the Complete Graph Into Hamiltonian Paths (Cycles) and 3-Stars
Discussiones Mathematicae Graph Theory, 2020 Let H be a graph. A decomposition of H is a set of edge-disjoint subgraphs of H whose union is H. A Hamiltonian path (respectively, cycle) of H is a path (respectively, cycle) that contains every vertex of H exactly once.
Lee Hung-Chih, Chen Zhen-Chun
doaj +1 more source
Advanced Science, EarlyView.Zero‐valent iron with a vacancy‐rich carbon shell and lattice Cu doping in Fe0 cores generates a dechlorination mechanism combining enhanced electron transfer and modulated H* spillover, which significantly lowers the energy barrier for dechlorinating low‐chlorinated intermediates, accelerates C─Cl bond dissociation, and then delivers breakthrough ...
Zimin Yan +7 more
wiley +1 more source
When the Cartesian product of directed cycles is hyper-Hamiltonian [PDF]
Discrete Mathematics Letters, 2021 Zbigniew R. Bogdanowicz
doaj +1 more source
Hamiltonian Strongly Regular Graphs [PDF]
We give a sufficient condition for a distance-regular graph to be Hamiltonian. In particular, the Petersen graph is the only connected non-Hamiltonian strongly regular graph on fewer than 99 vertices.Distance-regular graphs;Hamilton cycles JEL ...
Brouwer, A.E., Haemers, W.H.
core +1 more source
Hamiltonian Cycles in the Square of a Graph [PDF]
The Electronic Journal of Combinatorics, 2011 We show that under certain conditions the square of the graph obtained by identifying a vertex in two graphs with hamiltonian square is also hamiltonian. Using this result, we prove necessary and sufficient conditions for hamiltonicity of the square of a connected graph such that every vertex of degree at least three in a block graph corresponds to a
openaire +3 more sources
Advanced Science, EarlyView.The external field exceeds Hd, the speed polarization abruptly reorients to align with the Mn magnetic moments, leading to an MR ≈ −100%. Abstract Mn3Si2Te6, quasi‐2D ferrimagnetic semiconductor, exhibits anomalous saturated colossal magnetoresistance (CMR) only when a magnetic field is applied along its magnetic hard magnetization axis, suggesting ...
Shiqi Li +10 more
wiley +1 more source
Change ringing and Hamiltonian cycles: The search for Erin and Stedman triples
Electronic Journal of Graph Theory and Applications, 2019 A very old problem in campanology is the search for peals. The latter can be thought of as a heavily constrained sequence of all possible permutations of a given size, where the exact nature of the constraints depends on which method of ringing is ...
Michael Haythorpe, Andrew Johnson
doaj +1 more source