Fully Connected Graph Number Of Edges. Your reasoning is correct the n vertex graph with the maximal number of edges that is still disconnected is a K n 1 with an additional isolated vertex. A fully connected network doesnt need to use switching nor broadcasting.
Complete or fully. Answered 7 years ago. A fully connected network doesnt need to use switching nor broadcasting.
In short a directed graph needs to be a complete graph in order to contain the maximum number of edges.
In a complete graph every pair of vertices is connected by an edge. Answered 7 years ago. By inductive hypothesis both parts have at least n 1 1 and n 2 1 edges where n 1 n 2 n so your graph had at least n 1 1 n 2 1 1 n 1 edges the additional one denotes the last edge you removed before the graph stopped being connected. A tree is a connected graph in which there is no cycle.
