IDEAS home Printed from https://ideas.repec.org/a/bpj/jossai/v6y2018i5p459-472n6.html
   My bibliography  Save this article

Finding Cut-Edges and the Minimum Spanning Tree via Semi-Tensor Product Approach

Author

Listed:
  • Fan Xujiao
  • Xu Yong
  • Su Xue
  • Wang Jinhuan

    (School of Science, Hebei University of Technology, Tianjin300401, China)

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.

Suggested Citation

  • Fan Xujiao & Xu Yong & Su Xue & Wang Jinhuan, 2018. "Finding Cut-Edges and the Minimum Spanning Tree via Semi-Tensor Product Approach," Journal of Systems Science and Information, De Gruyter, vol. 6(5), pages 459-472, October.
    • Handle: RePEc:bpj:jossai:v:6:y:2018:i:5:p:459-472:n:6
    DOI: 10.21078/JSSI-2018-459-14
    as

    Download full text from publisher

    File URL: https://doi.org/10.21078/JSSI-2018-459-14
    Download Restriction: no
    File URL: https://libkey.io/10.21078/JSSI-2018-459-14?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:bpj:jossai:v:6:y:2018:i:5:p:459-472:n:6. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Peter Golla (email available below). General contact details of provider: https://www.degruyter.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.