Spanning Trees of Certain Types
A Spanning tree of a graph G is a subgraph that is a tree which concludes all of the vertices of G. And a graph G is bipartite if the vertex set of G can be partitioned in to two sets A and B, such that every edge of G joins a vertex of A and a vertex of B. We can see that every tree(including spann...
| Main Author: | |
|---|---|
| Format: | Others |
| Published: |
OpenSIUC
2016
|
| Subjects: | |
| Online Access: | https://opensiuc.lib.siu.edu/theses/2049 https://opensiuc.lib.siu.edu/cgi/viewcontent.cgi?article=3063&context=theses |