Combinatorial Algorithm for Finding Spanning Forests

Authors

  • Nuha Abd-uljabbar Department of Applied Sciences, University of Technology.
  • Manal N Yaqoob Department of Applied Sciences, University of Technology.

Keywords:

Spanning trees, combinatorial algorithm

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.



Downloads

Published

2012-06-01

Issue

Vol. 15 No. 2 (2012): June

Section

Articles

How to Cite

[1]
“Combinatorial Algorithm for Finding Spanning Forests”, ANJS, vol. 15, no. 2, pp. 152–155, Jun. 2012, Accessed: Apr. 19, 2024. [Online]. Available: https://anjs.edu.iq/index.php/anjs/article/view/1373