Results 21 to 30 of about 1,859,854 (274)
Grafos hamiltonianos en el diseño de viajes
Modelling in Science Education and Learning, 2013 The existence and, if applicable, the location of paths with given properties is a topic in graph theory. One of these problems is to find routes through all points, only once, starting and ending at the same node.
Cristina Jordán Lluch +1 more
doaj +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
On mutually independent hamiltonian paths
Applied Mathematics Letters, 2006 Two Hamiltonian paths \(P_1=\langle v_1,v_2,\dots,v_n\rangle\) and \(P_2=\langle u_1,u_2,\dots,u_n\rangle\) of an \(n\)-vertex graph \(G\) are independent if \(u_1=v_1\), \(u_n=v_n\), and \(u_i\neq v_i\) for ...
Teng, Yuan-Hsiang +3 more
openaire +2 more sources
Problems on Shortest k-Node Cycles and Paths
Кібернетика та комп'ютерні технології, 2021 The paper is devoted to the construction of mathematical models for problems on the shortest cycles and paths, that pass through a given number of nodes of a directed graph.
Petro Stetsyuk +2 more
doaj +1 more source
Noncrossing Hamiltonian Paths in Geometric Graphs [PDF]
Discrete Applied Mathematics, 2004 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Černý, Jakub +3 more
openaire +2 more sources
Solving the Hamiltonian path problem with a light-based computer [PDF]
Natural Computing, 2007 In this paper we propose a special computational device which uses light rays for solving the Hamiltonian path problem on a directed graph. The device has a graph-like representation and the light is traversing it by following the routes given by the ...
Mihai Oltean
semanticscholar +1 more source
Energy Conditions for Hamiltonian and Traceable Graphs
Universal Journal of Mathematics and Applications, 2019 A graph is called Hamiltonian (resp. traceable) if the graph has a Hamiltonian cycle (resp. path), a cycle (resp. path) containing all the vertices of the graph. The energy of a graph is defined as the sum of the absolute values of the eigenvalues of the
Rao Li
doaj +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 ...
Águeda, Raquel +5 more
openaire +6 more sources
Hamiltonian path, routing, broadcasting algorithms for connected square network graphs
Engineering Science and Technology, an International Journal, 2023 Connected Square Network Graphs (CSNG) in the study of Selcuk (2022) and Selcuk and Tankul (2022) is reconsidered in this paper. Although (CSNG) is a 2-dimensional mesh structure, the most important feature of this graph is that it is a hypercube variant.
Burhan Selçuk +1 more
doaj +1 more source
De-Signing Hamiltonians for Quantum Adiabatic Optimization [PDF]
Quantum, 2020 Quantum fluctuations driven by non-stoquastic Hamiltonians have been conjectured to be an important and perhaps essential missing ingredient for achieving a quantum advantage with adiabatic optimization.
Elizabeth Crosson +3 more
doaj +1 more source