Search All of the Math Forum:
Views expressed in these public forums are not endorsed by
Drexel University or The Math Forum.



Re: Is "connected graphs" > P(trees), G>{spanning trees of G} onetoone?
Posted:
Mar 4, 2004 12:56 PM


On Tue, 2 Mar 2004 20:20:59 +0100, "sasha" <sashaLOESCHEDIESmal.REMOVEITexcite.com@news.sdt.net (AT)> wrote:
>Hello everyone! > >For a given natural number m, is the map > >connected graphs with m edges > power set of trees, >G > {spanning trees of G} > >onetoone?
Yes, for simple graphs. No, if loops or parallel edges are allowed: a graph with one loop and one simple edge has the same spanning tree as a graph with two edges connecting the same 2 vertices.
Dan
 Dan Luecking Department of Mathematical Sciences University of Arkansas Fayetteville, Arkansas 72701 To reply by email, change LookInSig to luecking



