Élie De Panafieu - Enumeration and structure of inhomogeneous graphs

dmtcs:2501 - Discrete Mathematics & Theoretical Computer Science, January 1, 2015, DMTCS Proceedings, 27th International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2015) - https://doi.org/10.46298/dmtcs.2501
Enumeration and structure of inhomogeneous graphsArticle

Authors: Élie De Panafieu

    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

    https://doi.org/10.46298/dmtcs.2501
    Source: HAL:hal-01337762v1
    Volume: DMTCS Proceedings, 27th International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2015)
    Section: Proceedings
    Published on: January 1, 2015
    Imported on: November 21, 2016
    Keywords: generating functions,analytic combinatorics,multivariate Laplace method,inhomogeneous graphs,[INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM]
    Licence: Attribution 4.0 International (CC BY 4.0)

    Share and export

    Consultation statistics

    This page has been seen 263 times.
    This article's PDF has been downloaded 420 times.