55,155 research outputs found
Completely Independent Spanning Trees in Line Graphs
Completely independent spanning trees in a graph are spanning trees of
such that for any two distinct vertices of , the paths between them in
the spanning trees are pairwise edge-disjoint and internally vertex-disjoint.
In this paper, we present a tight lower bound on the maximum number of
completely independent spanning trees in , where denotes the line
graph of a graph . Based on a new characterization of a graph with
completely independent spanning trees, we also show that for any complete graph
of order , there are completely
independent spanning trees in where the number is optimal, such that completely
independent spanning trees still exist in the graph obtained from by
deleting any vertex (respectively, any induced path of order at most
) for or odd (respectively, even ).
Concerning the connectivity and the number of completely independent spanning
trees, we moreover show the following, where denotes the minimum
degree of . Every -connected line graph has
completely independent spanning trees if is not super edge-connected or
. Every -connected line graph
has completely independent spanning trees if is regular.
Every -connected line graph with has
completely independent spanning trees.Comment: 20 pages with 5 figure
On Minimum Average Stretch Spanning Trees in Polygonal 2-trees
A spanning tree of an unweighted graph is a minimum average stretch spanning
tree if it minimizes the ratio of sum of the distances in the tree between the
end vertices of the graph edges and the number of graph edges. We consider the
problem of computing a minimum average stretch spanning tree in polygonal
2-trees, a super class of 2-connected outerplanar graphs. For a polygonal
2-tree on vertices, we present an algorithm to compute a minimum average
stretch spanning tree in time. This algorithm also finds a
minimum fundamental cycle basis in polygonal 2-trees.Comment: 17 pages, 12 figure
Orderly Spanning Trees with Applications
We introduce and study the {\em orderly spanning trees} of plane graphs. This
algorithmic tool generalizes {\em canonical orderings}, which exist only for
triconnected plane graphs. Although not every plane graph admits an orderly
spanning tree, we provide an algorithm to compute an {\em orderly pair} for any
connected planar graph , consisting of a plane graph of , and an
orderly spanning tree of . We also present several applications of orderly
spanning trees: (1) a new constructive proof for Schnyder's Realizer Theorem,
(2) the first area-optimal 2-visibility drawing of , and (3) the best known
encodings of with O(1)-time query support. All algorithms in this paper run
in linear time.Comment: 25 pages, 7 figures, A preliminary version appeared in Proceedings of
the 12th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2001),
Washington D.C., USA, January 7-9, 2001, pp. 506-51
- β¦