On size, order, diameter and edge-connectivity of graphs
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.
scientific article; zbMATH DE number 6837889