Results 41 to 50 of about 3,678 (251)
Hamiltonian colorings of graphs with long cycles [PDF]
, 2003 summary:By a hamiltonian coloring of a connected graph $G$ of order $n \ge 1$ we mean a mapping $c$ of $V(G)$ into the set of all positive integers such that $\vert c(x) - c(y)\vert \ge n - 1 - D_G(x, y)$ (where $D_G(x, y)$ denotes the length of a ...
Nebeský, Ladislav
core +1 more source
Measurement + Control, 2019 Wheeled mobile robots are widely utilized for environment-exploring tasks both on earth and in space. As a basis for global path planning tasks for wheeled mobile robots, in this study we propose a method for establishing an energy-based cost map.
Bo You +4 more
doaj +1 more source
Solving a Hamiltonian Path Problem with a bacterial computer
Journal of Biological Engineering, 2009 Background The Hamiltonian Path Problem asks whether there is a route in a directed graph from a beginning node to an ending node, visiting each node exactly once. The Hamiltonian Path Problem is NP complete, achieving surprising computational complexity
Treece Jessica +18 more
doaj +1 more source
Ferroelectricity in Antiferromagnetic Wurtzite Nitrides
Advanced Functional Materials, EarlyView.We establish MnSiN2${\rm MnSiN}_2$ and MnGeN2${\rm MnGeN}_2$ as aristotypes of a new multiferroic wurtzite family that simultaneously exhibits ferroelectricity and antiferromagnetism with altermagnetic spin splitting. By strategically substituting alkaline‐earth metals, we predict new materials with coexisting switchable polarization, spin texture, and
Steven M. Baksa +3 more
wiley +1 more source
Path Independence in Adiabatic Quantum Computing for Hadamard Gate
Journal of Mathematical and Fundamental Sciences, 2014 The computation time in adiabatic quantum computing (AQC) is determined by the time limit of the adiabatic evolution, which in turn depends on the evolution path. In this research we have used the variational method to find an optimized path.
Jusak Sali Kosasih +2 more
doaj +1 more source
IEEE Access, 2021 In order to solve the NP-hard problem of mobile sink path planning in wireless sensor networks (WSN) where the communication range is modeled as a circular area and overlaps with each other, this paper proposes a sink node path planning method guided by ...
Zhijie Huang +4 more
doaj +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
On Hamiltonian paths in distance graphs
Applied Mathematics Letters, 2011 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Christian Löwenstein +2 more
openaire +1 more source
Switchable Magnonic Crystals Based on Spin Crossover/CrSBr Heterostructures
Advanced Materials, EarlyView.Multiscale modeling is employed to investigate the functionality of a light‐controlled, tunable magnonic crystal based on spin‐crossover Fe‐pz molecules integrated with a monolayer of CrSBr. Ab initio simulations confirm that the molecules remain functional on the CrSBr surface, while a semiclassical elastic model demonstrates that light‐induced ...
Andrei Shumilin +4 more
wiley +1 more source
On hamiltonian chain saturated uniform hypergraphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2012 Graphs and ...
Aneta Dudek, Andrzej Zak
doaj +1 more source