PulseExploreJournal ClubDebatesTrendingResearchersJournals
Instagram
HomeExploreJournal ClubTrending
Synapse
⌘+K
Synapse
February 25, 2026Graphs and Combinatorics0 citationsOpen Access

All generalized rose window graphs are hamiltonian

SBSimona BonviciniTPTomaž PisanskiAŽArjana Žitnik

Key Points

  • The aim is to conjecture and demonstrate that all connected bicirculants of valence at least 2 are hamiltonian.
  • Analyzed properties of generalized rose window graphs.
  • Extended previous results on hamiltonicity from cubic bicirculants.
  • Proved the conjecture specifically for quartic bicirculants with vertex connectivity of 2.
  • Confirmed that generalized rose window graphs are hamiltonian.
  • No exceptions found among connected bicirculants of valence at least 2.
  • Supported the conjecture for all cubic bicirculants and extended findings to quartic forms.

Abstract

Abstract A bicirculant is a regular, d -valent graph that admits a semiregular automorphism of order m having two vertex-orbits of size m. The vertices of each orbit induce a circulant graph of order m and the remaining edges span a regular bipartite graph of valence, say s, 1 s d 1 ≤ s ≤ d, connecting the two vertex-orbits. Generalized Petersen graphs constitute a prominent family of bicirculants, with d = 3 d = 3 and s = 1 s = 1. In 1983, Brian Alspach proved that all generalized Petersen graphs are hamiltonian, except for the family G (m, 2) with m 5 6 m ≡ 5 (mod 6). In this paper we conjecture that among all connected bicirculants of valence at least 2, there are no other exceptions. It follows from various sources that the conjecture is true for all cubic bicirculants. In this paper we prove the conjecture for quartic bicirulants with s = 2 s = 2, also known as the generalized rose window graphs.

Ask AI
Helpful
Bookmark
Share
View Full Paper

Cite This Study

Bonvicini et al. (2026) studied this question.

synapsesocial.com/papers/699e9152f5123be5ed04ed0ehttps://doi.org/10.1007/s00373-026-03016-w
Ask AI
Helpful
Bookmark
Share
View Full Paper