On May 13, 2:20 am, brunotavila <[EMAIL PROTECTED]> wrote:
> Hi people,
>
> How to calculate the number of binary trees that are subgraphs of a
> given connected, undirected, unweighted and simple (no parallel edges
> nor loops) graph?
>
> Bruno
> This problem was studied in chemistry, at first by Harry Wiener.
> And it is known as Wiener number. In chemistry, more important that
> the number of binary trees is their total length, sum of distances between
> vertices.
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
-~----------~----~----~----~------~----~------~--~---
