(mathematics) A spanning tree of a graph G is a subgraph of G which is a tree and which includes all the vertices in G.
spanning tree
| Sci-Tech Dictionary: spanning tree |
(′span·iŋ ′trē)
| 5min Related Video: spanning tree |
Learn More
 | BPDU (technology) |
| spanning tree algorithm (technology) |
| STP (technology) |
 | What is the life span of Oak trees? Read answer... |
| What is the purpose of the Spanning Tree algorithm? Read answer... |
| What is the life span of eucalyptus tree? Read answer... |
Help us answer these
 | How to get a second best spanning tree? |
| What is the life span of a pear tree? |
| What is the life span of a banyan tree? |
Post a question - any question - to the WikiAnswers community:
Copyrights:
 |
 | Sci-Tech Dictionary. McGraw-Hill Dictionary of Scientific and Technical Terms. Copyright © 2003, 1994, 1989, 1984, 1978, 1976, 1974 by McGraw-Hill Companies, Inc. All rights reserved. Read more |
Related answers
- How do you count spanning trees in a graph?
- What is the life span of a locust tree?
- Life span of coconut tree?
- Life span of a moringa tree?
ADVERTISEMENT
Answer these
- What is the life span of a baniyan tree?
- What is life span of a plum tree?
- What is the span of all tree sizes?
- Minimum spanning tree?
Mentioned in
- BPDU (technology)
- spanning tree algorithm (technology)
- STP (technology)
- transparent bridge (technology)
