Generating function for representations of graphs by k-partite graphs

DOI10.17223/20710410/31/1MaRDI QIDQ5150720zbMATH OpenOpenAlexFDO

Authors R. M. Ganopol'skiĭ

Publication date 15 February 2021

Published in Prikladnaya diskretnaya matematika (Search for Journal in Brave)

Full work available at URL http://mathnet.ru/eng/pdm532

zbMATH Keywords

\(k\)-partite graphchromatic polynomialgenerating functionsgraphhypergraphmultigraphweighted sum

Mathematics Subject Classification ID

Enumeration in graph theory (05C30) Graph polynomials (05C31)

Recommendations

• scientific article; zbMATH DE number 7310289
• Enumeration of graphs with given weighted number of connected components
• The chromatic generating function
• The generating function of irreducible coverings by edges of complete k-partite graphs
• On the enumeration of certain weighted graphs

Cites work

• Generating functions for sequences of connected covers numbers
• Generating functions for sequences of disordered covers numbers
• scientific article; zbMATH DE number 718142 (Why is no real title available?)
• scientific article; zbMATH DE number 7310289 (Why is no real title available?)
• scientific article; zbMATH DE number 3290993 (Why is no real title available?)
• Introduction to superstrings
• The number of disordered covers of a finite set by subsets having fixed cardinalities

Cited in

(6)

• Generating function for \(K\)-restricted jagged partitions
• The generating function of irreducible coverings by edges of complete k-partite graphs
• scientific article; zbMATH DE number 563034 (Why is no real title available?)
• Enumeration of graphs with given weighted number of connected components
• scientific article; zbMATH DE number 7310289 (Why is no real title available?)
• On the enumeration of certain weighted graphs

This page was built for publication: Generating function for representations of graphs by \(k\)-partite graphs

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