Cycle Polynomials

DOI10.2307/2043927MaRDI QIDQ3934390zbMATH OpenOpenAlexFDO

Authors 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)

Cites work

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

Cited in

(7)

• Partitions of Z_n into arithmetic progressions
• On arithmetic partitions of \(\mathbb Z_n\)
• Two selection problems revisited
• 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

This page was built for publication: Cycle Polynomials

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3934390)