BIROn - Birkbeck Institutional Research Online

    Growth of graph powers

    Pokrovskiy, Alexey (2011) Growth of graph powers. The Electronic Journal of Combinatorics 18 (1), p. 88. ISSN 1077-8926.

    This is the latest version of this item.

    [img]
    Preview
    Text
    1005.2542.pdf - Author's Accepted Manuscript
    Available under License Creative Commons Attribution Non-commercial No Derivatives.

    Download (246kB) | Preview

    Abstract

    For a graph G, its rth power is constructed by placing an edge between two vertices if they are within distance r of each other. In this note we study the amount of edges added to a graph by taking its rth power. In particular we obtain that either the rth power is complete or "many" new edges are added. This is an extension of a result obtained by P. Hegarty for cubes of graphs.

    Metadata

    Item Type: Article
    School: School of Business, Economics & Informatics > Economics, Mathematics and Statistics
    Depositing User: Alexey Pokrovskiy
    Date Deposited: 21 Jan 2019 15:49
    Last Modified: 26 Feb 2021 11:42
    URI: https://eprints.bbk.ac.uk/id/eprint/25902

    Available Versions of this Item

    • Growth of graph powers. (deposited 21 Jan 2019 15:49) [Currently Displayed]

    Statistics

    Downloads
    Activity Overview
    19Downloads
    56Hits

    Additional statistics are available via IRStats2.

    Archive Staff Only (login required)

    Edit/View Item Edit/View Item