Results 81 to 90 of about 1,860,621 (344)
The Hamiltonian index of a graph and its branch-bonds [PDF]
, 2001 Let $G$ be an undirected and loopless finite graph that is not a path. The minimum $m$ such that the iterated line graph $L^m(G)$ is hamiltonian is called the hamiltonian index of $G,$ denoted by $h(G).$ A reduction method to determine the hamiltonian ...
Broersma, Haitze J. +4 more
core +1 more source
Hamiltonian paths in L-shaped grid graphs
Theoretical Computer Science, 2016 28 pages, 31 figures, and 20 ...
Keshavarz-Kohjerdi, Fatemeh +1 more
openaire +3 more sources
Energy Consumption Optimization in Trajectory Planning for Fuel Cell Hybrid Uavs Based On HMPC
Advanced Robotics Research, EarlyView.The endurance limitation of multirotor drones is a critical challenge. This study adopts a hybrid power system of fuel cells and lithium‐ion batteries. Using Nondominated Sorting Genetic Algorithm II, it integrates trajectory planning with energy management optimization.
Xindi Wang +7 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
Advanced Science, EarlyView.Li‐ and V‐intercalated V2Se2O bilayers possess intralayer ferrimagnetic and interlayer ferromagnetic orders, alongside ferroelasticity, in‐plane uniaxial magnetic anisotropy, half‐metal/enhanced spin splitting, the anomalous Hall effect, giant magnetoresistance, tunneling magnetoresistance, near‐perfect spin filtering effect, spin Seebeck effect, and ...
Long Zhang +7 more
wiley +1 more source
Physical Review Research, 2020 Comprehending the dynamical behavior of quantum systems driven by time-varying Hamiltonians is particularly difficult. Systems with as little as two energy levels are not yet fully understood as the usual methods including diagonalization of the ...
Pierre-Louis Giscard, Christian Bonhomme
doaj +1 more source
Extended Lucas Tube: Graf Hamiltonian Baru [PDF]
, 2008 A Hamiltonian cycle in a connected graph G is defined as a closed walk that traverses every vertex of G exactly once, except the starting vertex at which the walk also terminates.
Ernastuti, E. (Ernastuti) +2 more
core
Transient Antiskyrmion‐Mediated Topological Transitions in Isotropic Magnets
Advanced Science, EarlyView.A transient antiskyrmion‐mediated pathway that drives repeated stripe‐to‐skyrmion transitions is revealed, producing a net increase in topological charge in isotropic Dzyaloshinskii–Moriya interaction films. Experiments and simulations identify the antiskyrmion as a metastable excitation, enabling stochastic bitstream generation for probabilistic ...
Bingqian Dai +18 more
wiley +1 more source
Advances in Mechanical Engineering, 2019 We propose a new local path planning approach based on optimization methods with probabilistic completeness in this article. This approach adds a linear constraint to the original covariant Hamiltonian optimization for motion planning problem with a new ...
Bo You +4 more
doaj +1 more source