On Counting Spanning Trees of the Graph
| dc.contributor.advisor | Tsegaye, Yirgalm (PhD) | |
| dc.contributor.author | Woudaj, Hailemichael | |
| dc.date.accessioned | 2018-07-16T11:13:23Z | |
| dc.date.accessioned | 2023-11-04T12:30:36Z | |
| dc.date.available | 2018-07-16T11:13:23Z | |
| dc.date.available | 2023-11-04T12:30:36Z | |
| dc.date.issued | 2011-01 | |
| dc.description.abstract | In this paper, we will observe how to find the spanning trees of a graph and the methods that we use to calculate. The methods that we use for calculating the spanning tree of the graph are deletion and contraction, matrix tree theorem and combinatorial interpretation of matrix tree theorem. In the matrix tree theorem we will explore an interesting relationship between linear algebra and graphs. In combinatorial interpretation we develop a new approach by constructing the polynomial that enumerates the spanning trees of the graph according to degrees of all vertices. The matrix tree theorem does not give the final answer to all problems concerning enumeration of trees because finding the determinant of a matrix is a complicated task for complicated graphs. So, this paper is useful to find the number of spanning trees of the complicated graph simply | en_US |
| dc.identifier.uri | http://etd.aau.edu.et/handle/123456789/8771 | |
| dc.language.iso | en | en_US |
| dc.publisher | Addis Ababa University | en_US |
| dc.subject | On Counting Spanning | en_US |
| dc.title | On Counting Spanning Trees of the Graph | en_US |
| dc.type | Thesis | en_US |