122 search results - page 1 / 25 » On pancyclism in hamiltonian graphs |
89
Voted
GC
2010
Springer
14 years 8 months ago
2010
Springer
A graph of order n is said to be pancyclic if it contains cycles of all lengths from three to n. Let G be a hamiltonian graph and let x and y be vertices of G that are consecutive ...
98
Voted
JCT
2010
14 years 9 months ago
2010
A graph G on n vertices is Hamiltonian if it contains a cycle of length n and pancyclic if it contains cycles of length for all 3 ≤ ≤ n. Write α(G) for the independence numbe...
49
Voted
DM
2002
14 years 10 months ago
2002
HPCC
2007
Springer
15 years 5 months ago
2007
Springer
The OTIS-Network (also referred to as two-level swapped network) is composed of n clones of an n-node original network constituting its clusters. It has received much attention due...
85
Voted
JGT
2007
14 years 10 months ago
2007
A graph is uniquely hamiltonian if it contains exactly one hamiltonian cycle. In this note we prove that there are no r-regular uniquely hamiltonian graphs when r > 22. This im...