Results 41 to 50 of about 1,982,910 (295)
Removable matchings and hamiltonian cycles
Discrete Mathematics, 2009 The authors show the following two results: {\parindent=5mm \begin{itemize}\item[1)]Let \(G\) be a graph of order \(n\geq 4k+3\) with \(\sigma_2 (G)\geq n\) and let \(F\) be a matching of size \(k\) in \(G\) such that \(G-F\) is 2-connected. Then \(G-F\) is hamiltonian or \(G\cong K_2 +(K_2\cup K_{n-4})\) or \(G\cong \bar{K_2} +(K_2\cup K_{n-4 ...
Zhiquan Hu, Hao Li
openaire +1 more source
Hamiltonian cycles in polyhedral maps [PDF]
Proceedings - Mathematical Sciences, 2017 14 ...
Maity, Dipendu, Upadhyay, Ashish Kumar
openaire +2 more sources
A Proof of the Isoenergetic KAM-Theorem from the “Ordinary” One [PDF]
, 1991 A proof is given of the isoenergetic KAM-theorem for Hamiltonian systems, using the “ordinary” KAM-theorem and a transversality argument.
Broer, H.W. +6 more
core +2 more sources
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
A Survey on Hamiltonian Cycles
Interdisciplinary Information Sciences, 2001 The author surveys some of the classical results on Hamiltonian cycles in undirected graphs and pays particular attention to the development over the last decade. Among the subjects are: binding number, toughness, degree conditions, closure, regular graphs, and graphs on surfaces. This is intended as a supplement to the survey of \textit{R. J.
openaire +3 more sources
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
Some notes on port-Hamiltonian systems on Banach spaces [PDF]
, 2021 We consider port-Hamiltonian systems from a functional analytic perspective. Dirac structures and Hamiltonians on Banach spaces are introduced, and an energy balance is proven.
Reis, Timo
core +1 more source
Hamiltonian Normal Cayley Graphs
Discussiones Mathematicae Graph Theory, 2019 A variant of the Lovász Conjecture on hamiltonian paths states that every finite connected Cayley graph contains a hamiltonian cycle. Given a finite group G and a connection set S, the Cayley graph Cay(G, S) will be called normal if for every g ∈ G we ...
Montellano-Ballesteros Juan José +1 more
doaj +1 more source
A Note Concerning Hamilton Cycles in Some Classes of Grid Graphs
Journal of Mathematical and Fundamental Sciences, 2013 A graph G is called hamiltonian if it contains a Hamilton cycle, i.e. a cycle containing all vertices. Deciding whether a given graph has a Hamilton cycle is an NP-complete problem. But, it is a polynomial problem within some special graph classes.
A. N.M. Salman +2 more
doaj +1 more source
Hierarchical Hexagon: A New Fault-Tolerant Interconnection Network for Parallel Systems
Cybernetics and Information Technologies, 2021 A new interconnection network topology called Hierarchical Hexagon HH(n) is proposed for massively parallel systems. The new network uses a hexagon as the primary building block and grows hierarchically.
Tripathy Laxminath +1 more
doaj +1 more source