Title of article
Combinatorial Algorithm for Finding Spanning Forests
Author/Authors
Abd-uljabbar, Nuha University of Technology - Department of Applied Sciences, Iraq , Yaqoob, Manal N. University of Technology - Department of Applied Sciences, Iraq
From page
152
To page
155
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.
Journal title
Al-Nahrain Journal Of Science
Journal title
Al-Nahrain Journal Of Science
Record number
2645678
Link To Document