0 votes 0 votes Graph Theory graph-theory discrete-mathematics engineering-mathematics + – Vicky rix asked Mar 8, 2017 Vicky rix 381 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
1 votes 1 votes a graph with (n-1) vertices can have a maximum of [ (n-1)(n-2) ] /2 edges .Incase if we try to add one more edge,then we might have to include that one isolated vertex as well and so the graph will become connected. Vicky rix answered Mar 8, 2017 Vicky rix comment Share Follow See 1 comment See all 1 1 comment reply 2018 commented Mar 8, 2017 reply Follow Share should be a disconnected graph with n vertex can have max (n-1)(n-2)/2 edges. more than that edge make graph connected in any how. 0 votes 0 votes Please log in or register to add a comment.
0 votes 0 votes For any graph $(n-k)\leq e\leq ((n-k)(n-k+1))/2$ here put k=1 ( k is no of components) so, $(n-1)\leq e\leq ((n-1)(n-2))/2$ any edge greater than ((n-1)(n-2))/2 will surely make the graph connnected Vasu_gate2017 answered Mar 9, 2017 Vasu_gate2017 comment Share Follow See all 0 reply Please log in or register to add a comment.