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 [email protected]
To unsubscribe from this group, send email to [EMAIL PROTECTED]
For more options, visit this group at http://groups.google.com/group/algogeeks
-~----------~----~----~----~------~----~------~--~---
