On size, order, diameter and edge-connectivity of graphs
type: Item
instance of: scholarly article
title: On size, order, diameter and edge-connectivity of graphs
zbMATH Open document ID: 1399.05117
author: Simon Mukwembi
author: Tomáš Vetrík
author: Patrick Ali
author: J. P. Mazorodze
published in: Acta Mathematica Hungarica
publication date: 2018-02-13T00:00:00Z
review text: 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.
reviewed by: Vilmar Trevisan
Mathematics Subject Classification ID: 05C35
Mathematics Subject Classification ID: 05C12
Mathematics Subject Classification ID: 05C40
zbMATH DE Number: 6837889
zbMATH Keywords: extremal graph theory
zbMATH Keywords: size
zbMATH Keywords: order
zbMATH Keywords: diameter
zbMATH Keywords: edge-connectivity
MaRDI profile type: Publication
full work available at URL: s10474-017-0699-1
OpenAlex ID: W2603475120
cites work: Q4129477
cites work: Graphs of maximum diameter
cites work: Q3773907
cites work: Maximum sizes of graphs with given domination parameters
cites work: Minimum size of a graph or digraph of given radius
cites work: Radius, diameter, and minimum degree
cites work: The maximum number of edges in a minimal graph of diameter 2
cites work: On size, order, diameter and minimum degree
cites work: Diameters in graphs
cites work: Q3366921
cites work: On the least size of a graph with a given degree set
cites work: Q5541882
DOI: 10.1007/S10474-017-0699-1
description: scientific article; zbMATH DE number 6837889