Abstract
We determine the maximum size of a graph of given order, diameter, and edge-connectivity \(\lambda\) for \(2\leq \lambda \leq 7\). This completes the determination of the maximum size of graphs with given order, diameter and edge-connectivity \(\lambda\) which had previously been done for \(\lambda=1\) and \(\lambda \geq 8\).
We further prove that upper bounds on the size of a graph of given order and diameter having certain additional properties can be extended to Eulerian digraphs, provided the additional properties satisfy some mild conditions. As an application of this result we prove that upper bounds on the size of graphs with given order, diameter and either edge-connectivity, connectivity, or minimum degree can be extended to Eulerian digraphs.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Ali, P., Mazorodze, J.P., Mukwembi, S., Vetrík, T.: On size, order, diameter and edge-connectivity of graphs. Acta Math. Hungar. 152, 11–24 (2017)
Caccetta, L., Smyth, W.F.: Properties of edge-maximal \(K\)-edge-connected \(D\)-critical graphs. J. Combin. Math. Combin. Comput. 2, 111–131 (1987)
Caccetta, L., Smyth, W.F.: Redistribution of vertices for maximum edge count in \(K\)-edge-connected \(D\)-critical graphs. Ars Combin. 26, 115–132 (1988)
Caccetta, L., Smyth, W.F.: Graphs of maximum diameter. Discrete Math. 102, 121–141 (1992)
Dankelmann, P., Volkmann, L.: The diameter of almost Eulerian digraphs. Electron. J. Combin. 17, R157 (2010)
Dankelmann, P.: Distance and size in digraphs. Discrete Math. 338, 144–148 (2015)
Dankelmann, P., Dorfling, M.: Diameter and maximum degree in Eulerian digraphs. Discrete Math. 339, 1355–1361 (2016)
Erdős, P., Pach, J., Pollack, R., Tuza, Z.: Radius, diameter, and minimum degree. J. Combin. Theory Ser. B 47, 73–79 (1989)
Mukwembi, S.: A note on diameter and the degree sequence of a graph. Appl. Math. Lett. 25, 175–178 (2012)
Mukwembi, S.: On size, order, diameter and minimum degree. Indian J. Pure Appl. Math. 44, 467–472 (2013)
Ore, O.: Diameters in graphs. J. Combin. Theory 5, 75–81 (1968)
N. A. Ostroverhiĭ, V. V. Strok and N. P. Homenko, Diameter critical graphs and digraphs, in: Topological Aspects of Graph Theory, Izdanie Inst. Mat. Akad. Nauk. Ukrain. SSR (Kiev, 1971), pp. 214–271 (in Russian)
Plesník, J.: On the sum of all distances in a graph or digraph. J. Graph Theory 8, 1–24 (1984)
Rho, Y., Kim, B.M., Hwang, W., Song, B.C.: Minimum orders of Eulerian oriented digraphs with given diameter, Acta Math. Sinica, English Series 30, 1125–1132 (2014)
Soares, J.: Maximum diameter of regular digraphs. J. Graph Theory 16, 437–450 (1992)
Author information
Authors and Affiliations
Corresponding author
Additional information
Financial support by the South African National Research Foundation, grant 118521, is gratefully acknowledged.
Rights and permissions
About this article
Cite this article
Dankelmann, P. Size of graphs and digraphs with given diameter and connectivity constraints. Acta Math. Hungar. 164, 178–199 (2021). https://doi.org/10.1007/s10474-021-01137-7
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10474-021-01137-7