Log In Sign Up

On non-Hamiltonian cycle sets of satisfying Grinberg's Equation

by   Heping Jiang, et al.

In [1] we used a cycle basis of the cycle space to represent a simple connected graph G. If G is Hamiltonian, then there exists a set of cycles to be a solution of Grinberg's Equation. The result of the symmetric difference of these cycles is a Hamilton cycle of G. It is clear that a graph is not Hamiltonian if its Equation has no solutions. Conversely, not all graphs satisfying the Equation are Hamiltonian. In this paper, we reexamine the cycle combinations of Equality (3.3) in [1] and find a distinctive cycle set underlying the non-Hamiltonian combinations satisfying Grinberg's Equation. We detail the characteristics of this cycle set and the existing condition.


page 1

page 2

page 3

page 4


On a K_2,3 in non-Hamiltonian graphs

In a reduced graph [1], a I cycle-set is the set of cycles only connecte...

Components and Cycles of Random Mappings

Each connected component of a mapping {1,2,...,n}→{1,2,...,n} contains a...

A new constraint of the Hamilton cycle algorithm

Grinberg's theorem is a necessary condition for the planar Hamilton grap...

Hamiltonian cycles in hypercubes with faulty edges

Szepietowski [A. Szepietowski, Hamiltonian cycles in hypercubes with 2n-...

Hidden Hamiltonian Cycle Recovery via Linear Programming

We introduce the problem of hidden Hamiltonian cycle recovery, where the...

FHCP Challenge Set: The First Set of Structurally Difficult Instances of the Hamiltonian Cycle Problem

The FHCP Challenge Set, comprising of 1001 instances of Hamiltonian cycl...

Generalized Hamiltonian Dynamics and Chaos in Evolutionary Games on Networks

We study the network replicator equation and characterize its fixed poin...