Hostname: page-component-848d4c4894-mwx4w Total loading time: 0 Render date: 2024-07-03T12:41:10.254Z Has data issue: false hasContentIssue false
  • English
  • Français

Size, Order, and Connected Domination

Published online by Cambridge University Press:  20 November 2018

Simon Mukwembi
Simon Mukwembi*
Affiliation:
University of KwaZulu-Natal, Durban, South Africa e-mail: [email protected]
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

We give a sharp upper bound on the size of a triangle-free graph of a given order and connected domination. Our bound, apart from strengthening an old classical theorem of Mantel and of Turán improves on a theorem of Sanchis. Further, as corollaries, we settle a long standing conjecture of Graffiti on the leaf number and local independence for triangle-free graphs and answer a question of Griggs, Kleitman, and Shastri on a lower bound of the leaf number in triangle-free graphs.

Keywords

05C69sizeconnected dominationlocal independence numberleaf number
Type
Research Article
Information
Canadian Mathematical Bulletin , Volume 57 , Issue 1 , 14 March 2014 , pp. 141 - 144
Copyright
Copyright © Canadian Mathematical Society 2014

References

[1] Dankelmann, P. and Volkmann, L., Minimum size of a graph or digraph of given radius. Inform. Process. Lett. 109 (2009), no. 16, 971–973. http://dx.doi.org/10.1016/j.ipl.2009.06.001 Google Scholar
[2] DeLaVina, E. and Waller, B., Spanning trees with many leaves and average distance. Electron. J. Combin. 15 (2008), no. 1, Research Paper 33.Google Scholar
[3] Fernandes, L. M. and Gouveia, L. Minimal spanning trees with a constraint on the number of leaves. European J. Operational Research 104 (1998), 250–261.Google Scholar
[4] Griggs, J. R., Kleitman, D. J., and Shastri, A. Spanning trees with many leaves in cubic graphs. J. Graph Theory 13 (1989), no. 6, 669–695. http://dx.doi.org/10.1002/jgt.3190130604 Google Scholar
[5] Mantel, W., Problem 28, soln. by Gouventak, H., Mantel, W., J. Teixeira de Mattes, Schuh, F. and Wythoff, W. A.. Wiskundige Opgaven 10 (1907), 60–61.Google Scholar
[6] Mukwembi, S. and Munyira, S., Radius, diameter and the leaf number. QuaesMath, t.. (submitted).Google Scholar
[7] Ore, O., Diameters in graphs. J. Combin. Theory 5 (1968), 75–81. http://dx.doi.org/10.1016/S0021-9800(68)80030-4 Google Scholar
[8] Sanchis, L. A., On the number of edges of a graph with a given connected domination number. Discrete Math. 214 (2000), no. 1–3, 193–210. http://dx.doi.org/10.1016/S0012-365X(99)00143-0 Google Scholar
[9] Turán, P., On an extremal problem in graph theory. (Hungarian). Mat. és Fiz. Lapok 48 (1941), 436–452.Google Scholar
[10] Vizing, V., The number of edges in a graph of given radius. Soviet Math. Dokl. 8 (1967), 535–536.Google Scholar