TheConstructionofAllPossible

SpanningTreesofaGraph
Anisha Raghavan 13BCB0011
Ankit Ramakrishnan 13BCE0132
Neha Golani 13BCB0056

Abstract
The Spanning Tree generation problem
or the Spanning Tree Enumeration
problem [SPE] has been a very
important problem in Graph Theory.
In this paper we will be discussing the
various algorithms & implementations
pertaining
to
the genration
of
spanning trees. The algorithms used in
this paper will include a nave brute
force implentation that generates all
possible spaning trees and other
algorithms that will use computational
graphs and output relative changes
between spanning trees.
We shall be using Lemmas discussed
in C.J Mitty's IEEE Transcript [Mi65] ,
S. Kapoor and Ramesh's Manuscript
[KR92] . Other academic/research
papers that are used will be credited
in the references.

generate- and- test

procedure
for
connecting together a set of points
with the minimum amount of wire,
where the connection satis es some
additional constraint, e.g., a minimum
distance to be maintained between 2
wires.
In one algorithm used, the spanning
trees represented by a node and its
parent in the computation
tree di er in exactly one pair of edges,
i.e., the spanning tree at any node is
obtained by
exchanging an edge in the spanning
tree at its parent for an edge not
present in that
spanning tree. This exchange is
obtained from the fundamental cycles
of the graph. An edge external to a
spanning tree can be exchanged with
any edge in its fundamental cycle to
give a spanning tree which di ers from
the original spanning tree in exactly
one pair of edges. By repeating this
for all external edges, all spanning
trees which dffer from the original
spanning tree in one pair of edges can
be obtained.

References
http://mathworld.wolfram.com/Spanni
ngTree.html
Fig 1: Spanning Trees for Graphs with 4 Vertices
Software and programming language
implementations will be made using
Mathematica, Python, C/C++.

C.J. Minthy, A simple algorithm for

listing all the spanning trees of
directed and undirected graph, IEEE,
Trans. Circuit Thepry

Spanning Tree ennumeration would

find application in a subroutine of a

R. Jayakumar, Analysis and Study of

Spanning Tree Enumeraion Algorithm.