Skip to main content
2 of 2
added 5 characters in body
bof
  • 13.4k
  • 2
  • 43
  • 66

The answer to the second question is yes. A vertex-transitive connected finite graph (with more than two vertices) is $2$-connected, i.e., it can't be disconnected by removing a vertex. In a $2$-connected graph every pair of vertices lies on a cycle; this is a special case of Menger's theorem.

bof
  • 13.4k
  • 2
  • 43
  • 66