On the relationship between the diameter and the size of a boundary of a directed graph (Q1329425)

From MaRDI portal
scientific article
Language Label Description Also known as
English
On the relationship between the diameter and the size of a boundary of a directed graph
scientific article

    Statements

    On the relationship between the diameter and the size of a boundary of a directed graph (English)
    0 references
    0 references
    0 references
    4 July 1994
    0 references
    The authors establish a lower bound for the cardinality of a boundary \(B_ D(A)\) in a digraph \(D\) (\(A\) is a set of nodes of \(D\)) whose in- degree and out-degree are both at most \(\beta\geq 2\). This estimation yields several interesting corollaries.
    0 references
    diameter
    0 references
    lower bound
    0 references
    boundary
    0 references
    digraph
    0 references

    Identifiers