Minimum Diameter Spanning Tree - American Journal of Computational Mathematics

AJCM > Vol.8 No.3, September 2018

Minimum Diameter Spanning Tree ()

HTML XML

Download as PDF (Size: 427KB) PP. 203-208

DOI: 10.4236/ajcm.2018.83016 1,028 Downloads 3,700 Views Citations

Author(s)

V. T. Chandrasekaran¹, N. Rajasri²

Affiliation(s)

¹Department of Mathematics, Jawahar Science College, Neyveli, India.
²Department of Mathematics, Vallalar Arts and Science College, Vadalur, India.

ABSTRACT

In this paper, we discuss the simple connected graphs which have a minimum diameter spanning tree such that both have same domination number.

KEYWORDS

Diameter, Spanning Tree, Essential Dominating Vertex, Pan Graph, Ladar Graph

Share and Cite:

Chandrasekaran, V. and Rajasri, N. (2018) Minimum Diameter Spanning Tree. American Journal of Computational Mathematics, 8, 203-208. doi: 10.4236/ajcm.2018.83016.

Journals Menu

Follow SCIRP

	+1 323-425-8868
	customer@scirp.org
	+86 18163351462(WhatsApp)
	1655362766

	Paper Publishing WeChat

This work and the related PDF file are licensed under a Creative Commons Attribution 4.0 International License.

Free SCIRP Newsletters

Add your e-mail address to receive free newsletters from SCIRP.

Top

Journals Menu

Home

About SCIRP

Service

Policies