Edge density of new graph types based on a random digraph family (Q670163)

From MaRDI portal
Revision as of 19:20, 18 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Edge density of new graph types based on a random digraph family
scientific article

    Statements

    Edge density of new graph types based on a random digraph family (English)
    0 references
    0 references
    18 March 2019
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    arc density
    0 references
    asymptotic normality
    0 references
    central limit theorem
    0 references
    Delaunay tessellation and triangulation
    0 references
    proximity catch digraph
    0 references
    reflexivity
    0 references
    underlying graph
    0 references
    \(U\)-statistic
    0 references
    0 references