0 votes 0 votes S Harika asked Mar 30, 2017 S Harika 926 views answer comment Share Follow See 1 comment See all 1 1 comment reply srestha commented Mar 30, 2017 reply Follow Share disconnected means disconnected with some other vertex. but here is only one vertex. So, no chance of disconnection 0 votes 0 votes Please log in or register to add a comment.
3 votes 3 votes It is connected graph Its an complete graph as well as planar Tesla! answered Mar 30, 2017 • edited Mar 30, 2017 by Tesla! Tesla! comment Share Follow See all 0 reply Please log in or register to add a comment.
1 votes 1 votes All (1 in this case) vertices are rechable.So,it is connected. Also we cannot find any two vertices between which there is no path,so it is not disconnected. Angkit answered Mar 30, 2017 Angkit comment Share Follow See all 0 reply Please log in or register to add a comment.
0 votes 0 votes It is connected graph For disconnected graph k>1 Rameez Raza answered Mar 30, 2017 Rameez Raza comment Share Follow See all 0 reply Please log in or register to add a comment.