Differences between revisions 1 and 3 (spanning 2 versions)
⇤ ← Revision 1 as of 2010-12-18 07:45:09 →
Size: 405
Editor: koumudi
Comment:
← Revision 3 as of 2010-12-18 07:50:09 → ⇥
Size: 459
Editor: koumudi
Comment:
Deletions are marked like this. Additions are marked like this.
Line 8: Line 8:
Line 14: Line 15:
// it is proved that Bipartite graph (K(3,3))is not planar
Line 19: Line 21:
   * <Koumudi>, <Student>, <SNIST>
 		   * Koumudi, Student, SNIST

  • Book

    Advanced Engineering Mathematics

    Author

    Erwin Kreyszig

    Edition

    8th Edition 

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]}); // Bipartite graph (K(3,3))
g.plot()

g.is_planar()
 False //output
// it is proved that Bipartite graph (K(3,3))is not planar

  • Solution by:

    • Koumudi, Student, SNIST

Kreyszig-21.8-20-U (last edited 2010-12-18 07:50:09 by koumudi)