- Research Article
- 10.21078/jssi-2018-459-14
Finding Cut-Edges and the Minimum Spanning Tree via Semi-Tensor Product Approach
- Nov 05, 2018
- Journal of Systems Science and Information
- Xujiao Fan + 3 more +3
Abstract Using the semi-tensor product of matrices, this paper investigates cycles of graphs with application to cut-edges and the minimum spanning tree, and presents a number of new results and algorithms. Firstly, by defining a characteristic logical vector and using the matrix expression of logical functions, an algebraic description is obtained for cycles of graph, based on which a new necessary and sufficient condition is established to find all cycles for any graph. Secondly, using the necessary and sufficient condition of cycles, two algorithms are established to find all cut-edges and the minimum spanning tree, respectively. Finally, the study of an illustrative example shows that the results/algorithms presented in this paper are effective.
Read more