BIROn - Birkbeck Institutional Research Online

    On the connectivity of random m-orientable graphs and digraphs

    Fenner, Trevor and Frieze, A.M. (1982) On the connectivity of random m-orientable graphs and digraphs. Combinatorica 2 (4), pp. 347-359. ISSN 0209-9683.

    Full text not available from this repository.

    Abstract

    We consider graphs and digraphs obtained by randomly generating a prescribed number of arcs incident at each vertex. We analyse their almost certain connectivity and apply these results to the expected value of random minimum length spanning trees and arborescences. We also examine the relationship between our results and certain results of Erdős and Rényi.

    Metadata

    Item Type: Article
    School: School of Business, Economics & Informatics > Computer Science and Information Systems
    Depositing User: Sarah Hall
    Date Deposited: 23 Mar 2021 19:48
    Last Modified: 23 Mar 2021 19:48
    URI: https://eprints.bbk.ac.uk/id/eprint/43635

    Statistics

    Activity Overview
    6 month trend
    0Downloads
    6 month trend
    47Hits

    Additional statistics are available via IRStats2.

    Archive Staff Only (login required)

    Edit/View Item Edit/View Item