||'''Book'''|| Advanced Engineering Mathematics ||
 ||'''Author'''|| Erwin Kreyszig ||
 ||'''Edition'''|| 8th Edition ||

/* code_begins */

{{{
g=Graph()
g = Graph({1:[4,5,6], 2:[4,5,6],3:[4,5,6],4:[1,2,3],5:[1,2,3],6:[1,2,3]});
g.plot()
g.edges()
[(1, 4, None), (1, 5, None), (1, 6, None), (2, 4, None), (2, 5, None),
(2, 6, None), (3, 4, None), (3, 5, None), (3, 6, None)] //output

g.num_edges()
  9 //output
// this code is for demonstrating the COMPLETE BIPARTITE GRAPH and to calculate number of edges
}}}

/* code_ends */

 * '''Solution by''': 
   * koumudi, Student, SNIST