A graph is planar iff it does not contain K5 and K3,3 . read chapter 6 (Planar Graphs) from "Introduction to Graph Theory", Douglas B. West
2008/3/24 kunzmilan <[EMAIL PROTECTED]>: > > > > On 17 Bře, 10:38, sp1 <[EMAIL PROTECTED]> wrote: > > How to test an given graph is plannar? > > The answer gives its distance matrix. When distances between vertices > > of the graph are squared, the distance matrix of a plannar graph has > > only 4 nonzero eigenvalues. > kunzmilan > > > --~--~---------~--~----~------------~-------~--~----~ You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algogeeks@googlegroups.com To unsubscribe from this group, send email to [EMAIL PROTECTED] For more options, visit this group at http://groups.google.com/group/algogeeks -~----------~----~----~----~------~----~------~--~---
