IDEAS home Printed from https://ideas.repec.org/a/spr/jcomop/v43y2022i4d10.1007_s10878-021-00810-5.html
   My bibliography  Save this article

Spanning tree of a multiple graph

Author

Listed:
  • Alexander V. Smirnov

    (P.G. Demidov Yaroslavl State University)

Abstract

We study undirected multiple graphs of any natural multiplicity $$k>1$$ k > 1 . There are edges of three types: ordinary edges, multiple edges and multi-edges. Each edge of the last two types is a union of k linked edges, which connect 2 or $$(k+1)$$ ( k + 1 ) vertices, correspondingly. The linked edges should be used simultaneously. The multiple tree is a multiple graph with no multiple cycles. The number of edges may be different for multiple trees with the same number of vertices. We prove lower and upper bounds on the number of edges in an arbitrary multiple tree. Also we consider spanning trees of an arbitrary multiple graph. Special interest is paid to the case of complete spanning trees. Their peculiarity is that a multiple path joining any two selected vertices exists in the tree if and only if such a path exists in the initial graph. We study the properties of complete spanning trees and the problem of finding the minimum complete spanning tree of a weighted multiple graph.

Suggested Citation

  • Alexander V. Smirnov, 2022. "Spanning tree of a multiple graph," Journal of Combinatorial Optimization, Springer, vol. 43(4), pages 850-869, May.
    • Handle: RePEc:spr:jcomop:v:43:y:2022:i:4:d:10.1007_s10878-021-00810-5
    DOI: 10.1007/s10878-021-00810-5
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10878-021-00810-5
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10878-021-00810-5?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
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    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:spr:jcomop:v:43:y:2022:i:4:d:10.1007_s10878-021-00810-5. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.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.