Any chance I could get a copy of that as well? :)
On Mar 21, 3:49 am, Ashesh <[EMAIL PROTECTED]> wrote:
> Done.
>
> On Mar 20, 4:45 pm, VRC <[EMAIL PROTECTED]> wrote:
>
> > I am also interested to know about the solution? Would you please
> > email me? Thanks.
>
> > On 3月16日, 下午8時56分, Ashesh <[EM
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
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
--~--~-~--~
