The asymptotic number of labeled graphs with \(n\) vertices, \(q\) edges, and no isolated vertices (Q1369735): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(One intermediate revision by one other user not shown)
Property / DOI
 
Property / DOI: 10.1006/jcta.1997.2798 / rank
Normal rank
 
Property / cites work
 
Property / cites work: The asymptotic number of labeled connected graphs with a given number of vertices and edges / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198785 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3267900 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3953794 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asymptotic evaluation of the number of latin rectangles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4552272 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1006/JCTA.1997.2798 / rank
 
Normal rank

Latest revision as of 18:56, 10 December 2024

scientific article
Language Label Description Also known as
English
The asymptotic number of labeled graphs with \(n\) vertices, \(q\) edges, and no isolated vertices
scientific article

    Statements

    The asymptotic number of labeled graphs with \(n\) vertices, \(q\) edges, and no isolated vertices (English)
    0 references
    0 references
    0 references
    0 references
    23 February 1998
    0 references
    This paper provides an asymptotic formula for enumerating labeled graphs with the order and the size as two parameters. This formula is uniformly for the order and the size when the size is greater than a half order of the graph.
    0 references
    labeled graph
    0 references
    enumeration
    0 references
    asymptotic estimate
    0 references
    Euler-Maclaurin summation
    0 references
    0 references

    Identifiers