Research ArticleOpen AccessGoogle Scholar indexed
Minimum Diameter Spanning Tree
Department of Mathematics, Jawahar Science College, Neyveli, India
Department of Mathematics, Vallalar Arts and Science College, Vadalur, India
- 1 Department of Mathematics, Jawahar Science College, Neyveli, India
- 2 Department of Mathematics, Vallalar Arts and Science College, Vadalur, India
American Journal of Computational Mathematics·Volume 08 (2018)·Pages 203–208·Published 31 August 2018·DOI10.4236/ajcm.2018.83016
Copy link · social · email
Abstract
In this paper, we discuss the simple connected graphs which have a minimum diameter spanning tree such that both have same domination number.
KeywordsDiameterSpanning TreeEssential Dominating VertexPan GraphLadar Graph
- Cockayne, E.J. and Hedetniemi, S.T. (1977) Towards a Theory of Domination in Graphs. Networks, 7, 247-261. https://doi.org/10.1002/net.3230070305
- Harary, F., Norman, R.Z. and Cartwright, D. (1967) An Introduction to the Theory of Directed Graphs. John Wiley and Sons, New York.
- Liu, C.L. (1968) Introduction to Combinatorial Mathematics. McGraw-Hill, New York.
- Haray, F. (1969) Graph Theory. Addsion Wesley, Reading, MA. https://doi.org/10.21236/AD0705364
- Yamuna, M. and Karthika, K. (2013) Minimal Spanning Tree from a Minimum Dominating Set. WSEAS Transactions on Mathematics, 12, 1055-1064.
- Bray, N. and Weisstein, E.W. (2018) Domination Number. MathWorld—A Wolfram Web Resource, Champaign.