On the Enumeration of Certain Weighted Graphs

Simple item page
dc.creatorBóna, Miklós
dc.creatorJu, Hyeong-Kwan
dc.creatorYoshida, Ruriko
dc.date2006-06-07
dc.date.accessioned2026-07-07T07:17:02Z
dc.date.available2026-07-07T07:17:02Z
dc.descriptionWe 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 $\frac{p(x)}{(1-x)^{m+1}}$, where $m$ is the number of vertices of the graph and $p(x)$ is a polynomial of degree at most $m$.
dc.description25 pages
dc.identifierhttps://arxiv.org/abs/math/0606163
dc.identifierhttp://arxiv.org/abs/math/0606163
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/113799
dc.subjectCombinatorics
dc.titleOn the Enumeration of Certain Weighted Graphs
dc.typetext

Files

Collections

arXiv