2-generated Cayley digraphs on nilpotent groups have hamiltonian paths

Details 2-generated Cayley digraphs on nilpotent groups have hamiltonian paths 2-generated Cayley digraphs on nilpotent groups have hamiltonian paths

2011-03-28

arxiv.org/abs/1103.5293v3

Mathematics

Combinatorics

7 pages, no figures; corrected a few typographical errors

Scientific paper

Suppose G is a nilpotent, finite group. We show that if {a,b} is any
2-element generating set of G, then the corresponding Cayley digraph Cay(G;a,b)
has a hamiltonian path. This implies there is a hamiltonian path in every
connected Cayley graph on G that has valence at most 4.

Affiliated with

Also associated with

No associations

Rating

2-generated Cayley digraphs on nilpotent groups have hamiltonian paths does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with 2-generated Cayley digraphs on nilpotent groups have hamiltonian paths, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and 2-generated Cayley digraphs on nilpotent groups have hamiltonian paths will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-706863