On size, order, diameter and edge-connectivity of graphs (Q682097)

From MaRDI portal
scientific article
Language Label Description Also known as
English
On size, order, diameter and edge-connectivity of graphs
scientific article

    Statements

    On size, order, diameter and edge-connectivity of graphs (English)
    0 references
    0 references
    0 references
    0 references
    13 February 2018
    0 references
    In the present paper, the authors obtain upper bounds for the size (the number of edges) of a graph in terms of other parameters. More precisely, the paper finds novel bounds for the size of any graph \(G\) in terms of its order (number of vertices), diameter and edge-connectivity of \(G\). In case \(G\) is a triangle-free graph, the upper bounds are improved. All bounds presented in this paper are asymptotically sharp.
    0 references
    extremal graph theory
    0 references
    size
    0 references
    order
    0 references
    diameter
    0 references
    edge-connectivity
    0 references

    Identifiers