A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf
.
Enumeration and structure of inhomogeneous graphs
2015
Discrete Mathematics & Theoretical Computer Science
We analyze a general model of weighted graphs, introduced by de Panafieu and Ravelomanana (2014) and similar to the inhomogeneous graph model of Söderberg (2002). We investigate the sum of the weights of those graphs and their structure. Those results allow us to give a new proof in a more general setting of a theorem of Wright (1972) on the enumeration of properly colored graphs. We also discuss applications related to social networks Nous étudions un modèle de graphes pondérés, introduits par
doi:10.46298/dmtcs.2501
fatcat:eoprmzbhzjgblejdibortf4eiy