Results 31 to 40 of about 382 (214)
Hamiltonian cycles in polyhedral maps [PDF]
Proceedings - Mathematical Sciences, 2017 14 ...
Maity, Dipendu, Upadhyay, Ashish Kumar
openaire +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
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
Enforced hamiltonian cycles in generalized dodecahedra
Electronic Journal of Graph Theory and Applications, 2013 The H-force number of a hamiltonian graph G is the smallest number k with the property that there exists a set W ⊆ V (G) with |W| = k such that each cycle passing through all vertices of W is a hamiltonian cycle.
Maria Timkova
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
On the H-Force Number of Hamiltonian Graphs and Cycle Extendability
Discussiones Mathematicae Graph Theory, 2017 The H-force number h(G) of a hamiltonian graph G is the smallest cardinality of a set A ⊆ V (G) such that each cycle containing all vertices of A is hamiltonian. In this paper a lower and an upper bound of h(G) is given.
Hexel Erhard
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
Polarizable Vanadium Dipoles Promote Water Dissociation on Vanadium‐Based Metal Organic Framework
Advanced Functional Materials, EarlyView.The polarization of unpaired V 3d electrons weakens the H─O bond to improve water dissociation by the dual Vδ+:O─H and Pλ−:H─O coupling hydrogen bonds formation and relaxation. P@V‐MOF electrocatalyst shows low overpotentials (94 mV in acid, 178 mV in neutral, and 77 mV in alkaline solutions) with excellent stability for effective overall water ...
Xinjuan Liu +13 more
wiley +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