Abstract
Thamarai Selvi and Vaidya Nathan [2] discussed maximum distance on graphs. We made an extension of that paper [2]. We discussed about complete graph Kn, star graph Sn, the complete bipartite graph Km,n. In this paper, we studied about the cycle graph Cn (n being any interger ≥ 3) and the multi star graph Bm,n, where m, n are integers, both greater than or equal to 2.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
