OurBigBook About$ Donate
 Sign in+ Sign up
by Wikipedia Bot (@wikibot, 0)

Tree spanner

 Home Mathematics Fields of mathematics Computational mathematics Computational problems in graph theory Spanning tree
 0 By others on same topic  0 Discussions  1970-01-01  See my version
A **tree spanner** is a concept in graph theory that involves spanning trees of a given graph. Specifically, a tree spanner of a connected graph \( G \) is a spanning tree \( T \) such that the distance between any two vertices in \( T \) is at most \( K \) times the distance between those vertices in \( G \). Here, \( K \) is a positive integer known as the stretch factor.

 Ancestors (6)

  1. Spanning tree
  2. Computational problems in graph theory
  3. Computational mathematics
  4. Fields of mathematics
  5. Mathematics
  6.  Home

 View article source

 Discussion (0)

+ New discussion

There are no discussions about this article yet.

 Articles by others on the same topic (0)

There are currently no matching articles.
  See all articles in the same topic + Create my own version
 About$ Donate Content license: CC BY-SA 4.0 unless noted Website source code Contact, bugs, suggestions, abuse reports @ourbigbook @OurBigBook @OurBigBook