In this paper, we give a survey of spanning trees. We mainly deal with spanning trees having
some particular properties concerning a hamiltonian properties, for example, spanning trees …

A 2-Approximation Algorithm for Finding a Spanning Tree with Maximum Number of Leaves |
SpringerLink Skip to main content Advertisement SpringerLink Log in Menu Find a journal …

We consider the problem of finding a spanning tree with maximum number of leaves. A 2-
approximation algorithm is known for this problem, and a 3/2-approximation algorithm when …

It is known that graphs on n vertices with minimum degree at least 3 have spanning trees
with at least n/4+ 2 leaves and that this can be improved to (n+ 4)/3 for cubic graphs without …

Broadcasting in a computer network is a method of transferring a message to all recipients
simultaneously. It is common in this situation to use a tree with many leaves to perform the …

In this paper, we consider the problem of finding a spanning tree in a graph that maximizes
the number of leaves. We show the NP-hardness of this problem for graphs that are planar …

We present two lower bounds for the maximum number of leaves over all spanning trees of
a graph. For connected, triangle-free graphs on n vertices, with minimum degree at least …

A lot of heuristic algorithms, such as Evolutionary algorithms (EAs), are used to solve the
maximum leaf spanning tree (MLST) problem which is non-deterministic polynomial time …

Given an undirected simple graph, a subset of the vertices of the graph is a {\em dominating
set} if every vertex not in the subset is adjacent to at least one vertex in the subset. A subset …

We consider the problem of finding a spanning tree that maximizes the number of leaves
(MaxLeaf). We provide a 3/2-approximation algorithm for this problem when restricted to …