Cycle Polynomials

DOI10.2307/2043927zbMath0478.05005OpenAlexW4250502118MaRDI QIDQ3934390

Frank K. Hwang

Publication date: 1981

Full work available at URL: https://doi.org/10.2307/2043927

zbMATH Keywords

Whitworth bracelet problem

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Enumeration in graph theory (05C30)

Related Items (7)

Two selection problems revisited ⋮ Partitions of \(\mathbb Z_n\) into arithmetic progressions ⋮ On arithmetic partitions of \(\mathbb Z_n\) ⋮ Reliabilities of Double-Loop Networks ⋮ Selecting k objects from a cycle with p pairs of separation s ⋮ The generating function of whitworth runs ⋮ Selecting non-consecutive balls arranged in many lines

Cites Work

• Whitworth runs on a circle
• Blocking Probabilities for a Class of Spiderweb Channel Graphs
• Runs in a ring

This page was built for publication: Cycle Polynomials