Combinatorial Algorithm for Finding Spanning Forests | ||
| Journal of Al-Nahrain University - Science | ||
| Article 1, Volume 15, Issue 2, June 2012, Pages 152-155 | ||
| Authors | ||
| Nuha Abd-uljabbar; and Manal N. Yaqoob | ||
| Abstract | ||
| In this paper we present a new combinatorial algorithm for finding all different spanning forests for a disconnected graph G, depending on the adjacency matrix, the cyclomatic number, the combination between the numbers of edges and the cyclomatic number, and the permutation between the entries of the adjacency matrix to determine the spanning forests. | ||
| Keywords | ||
| Spanning trees; combinatorial algorithms | ||
|
Statistics Article View: 150 PDF Download: 65 |
||