(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 jacaranda trees? Read answer... |
| What is the life span of a banana tree? Read answer... |
| How do you count spanning trees in a graph? Read answer... |
Help us answer these
 | What is the life span of banyan tree? |
| What is a life span of an apple tree? |
| What is the life span of a moringa 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
- What is the life span of eucalyptus tree?
- What is the life span of a mahogany tree?
- What is the life span of an olive tree?
ADVERTISEMENT
Answer these
- What is the life span of a gulmohar tree?
- What is the Life span of an evergreen tree?
- Life span of poplar trees?
- Spanning tree algorithm?
Mentioned in
- BPDU (technology)
- spanning tree algorithm (technology)
- STP (technology)
- transparent bridge (technology)
