Asymptotic enumeration of vertex-transitive graphs of fixed valency

Primož Potočnik, Pablo Spiga, Gabriel Verret

    Research output: Contribution to journalArticle

    2 Citations (Scopus)

    Abstract

    Let G be a group and let S be an inverse-closed and identity-free generating set of G. The Cayley graph Cay(G,S) has vertex-set G and two vertices u and v are adjacent if and only if uv−1∈S. Let CAYd(n) be the number of isomorphism classes of d-valent Cayley graphs of order at most n. We show that log⁡(CAYd(n))∈Θ(d(log⁡n)2), as n→∞. We also obtain some stronger results in the case d=3.

    Original languageEnglish
    Pages (from-to)221-240
    Number of pages20
    JournalJournal of Combinatorial Theory. Series B
    Volume122
    DOIs
    Publication statusPublished - 1 Jan 2017

    Fingerprint

    Asymptotic Enumeration
    Vertex-transitive Graph
    Cayley Graph
    Generating Set
    Isomorphism Classes
    Adjacent
    If and only if
    Closed
    Vertex of a graph

    Cite this

    Potočnik, Primož ; Spiga, Pablo ; Verret, Gabriel. / Asymptotic enumeration of vertex-transitive graphs of fixed valency. In: Journal of Combinatorial Theory. Series B. 2017 ; Vol. 122. pp. 221-240.
    @article{a5d510752e89419d99c7e7efb81592a3,
    title = "Asymptotic enumeration of vertex-transitive graphs of fixed valency",
    abstract = "Let G be a group and let S be an inverse-closed and identity-free generating set of G. The Cayley graph Cay(G,S) has vertex-set G and two vertices u and v are adjacent if and only if uv−1∈S. Let CAYd(n) be the number of isomorphism classes of d-valent Cayley graphs of order at most n. We show that log⁡(CAYd(n))∈Θ(d(log⁡n)2), as n→∞. We also obtain some stronger results in the case d=3.",
    keywords = "3-Valent, Cayley, Cubic, Enumeration, GRR, Vertex-transitive",
    author = "Primož Potočnik and Pablo Spiga and Gabriel Verret",
    year = "2017",
    month = "1",
    day = "1",
    doi = "10.1016/j.jctb.2016.06.002",
    language = "English",
    volume = "122",
    pages = "221--240",
    journal = "Journal of combinatorial Theory Series B",
    issn = "0095-8956",
    publisher = "Academic Press",

    }

    Asymptotic enumeration of vertex-transitive graphs of fixed valency. / Potočnik, Primož; Spiga, Pablo; Verret, Gabriel.

    In: Journal of Combinatorial Theory. Series B, Vol. 122, 01.01.2017, p. 221-240.

    Research output: Contribution to journalArticle

    TY - JOUR

    T1 - Asymptotic enumeration of vertex-transitive graphs of fixed valency

    AU - Potočnik, Primož

    AU - Spiga, Pablo

    AU - Verret, Gabriel

    PY - 2017/1/1

    Y1 - 2017/1/1

    N2 - Let G be a group and let S be an inverse-closed and identity-free generating set of G. The Cayley graph Cay(G,S) has vertex-set G and two vertices u and v are adjacent if and only if uv−1∈S. Let CAYd(n) be the number of isomorphism classes of d-valent Cayley graphs of order at most n. We show that log⁡(CAYd(n))∈Θ(d(log⁡n)2), as n→∞. We also obtain some stronger results in the case d=3.

    AB - Let G be a group and let S be an inverse-closed and identity-free generating set of G. The Cayley graph Cay(G,S) has vertex-set G and two vertices u and v are adjacent if and only if uv−1∈S. Let CAYd(n) be the number of isomorphism classes of d-valent Cayley graphs of order at most n. We show that log⁡(CAYd(n))∈Θ(d(log⁡n)2), as n→∞. We also obtain some stronger results in the case d=3.

    KW - 3-Valent

    KW - Cayley

    KW - Cubic

    KW - Enumeration

    KW - GRR

    KW - Vertex-transitive

    UR - http://www.scopus.com/inward/record.url?scp=84997161550&partnerID=8YFLogxK

    U2 - 10.1016/j.jctb.2016.06.002

    DO - 10.1016/j.jctb.2016.06.002

    M3 - Article

    VL - 122

    SP - 221

    EP - 240

    JO - Journal of combinatorial Theory Series B

    JF - Journal of combinatorial Theory Series B

    SN - 0095-8956

    ER -