The generating function of whitworth runs

DOI10.1016/0012-365X(84)90002-5MaRDI QIDQ800926zbMATH OpenOpenAlexFDO

Authors N. E. Zubov

Publication date 1984

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0012-365x(84)90002-5

zbMATH Keywords

generating functionsWhitworth bracelet problemWhitworth runs

Mathematics Subject Classification ID

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

Review text

Consider the problem of obtaining, for a graph G, the generating function that gives the number of ways of selecting k vertices such that the subgraph induced by these vertices has exactly h edges. When G is a cycle, this is the Whitworth bracelet problem. \textit{F. K. Hwang} [Proc. Am. Math. Soc. 83, 215-219 (1981; Zbl 0478.05005)] has studied the case when G consists of m components that are cycles of possibly different lengths. This paper includes further technical work on these generating functions. This enables the cases to be studied in which G has 2 components that are one cycle and one path, or two paths.

Recommendations

• scientific article; zbMATH DE number 806865
• On the enumeration of certain weighted graphs
• Two selection problems revisited
• scientific article; zbMATH DE number 1051011
• scientific article; zbMATH DE number 2098028

Cites work

• Cycle Polynomials
• scientific article; zbMATH DE number 3623560 (Why is no real title available?)

Cited in

(1)

• scientific article; zbMATH DE number 806865 (Why is no real title available?)

This page was built for publication: The generating function of whitworth runs

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