On the enumeration of certain weighted graphs

From MaRDI portal
(Redirected from Publication:997075)




Abstract: We enumerate weighted graphs with a certain upper bound condition. We also compute the generating function of the numbers of these graphs, and prove that it is a rational function. In particular, we show that if the given graph is a bipartite graph, then its generating function is of the form fracp(x)(1x)m+1, where m is the number of vertices of the graph and p(x) is a polynomial of degree at most m.



Cites work



Describes a project that uses

Uses Software





This page was built for publication: On the enumeration of certain weighted graphs

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