IDEAS home Printed from https://ideas.repec.org/a/spr/jcomop/v35y2018i4d10.1007_s10878-018-0249-y.html
   My bibliography  Save this article

Edge-disjoint spanning trees and the number of maximum state circles of a graph

Author

Listed:
  • Xiaoli Ma

    (Xinjiang University)

  • Baoyindureng Wu

    (Xinjiang University)

  • Xian’an Jin

    (Xiamen University)

Abstract

Motivated by the connection with the genus of unoriented alternating links, Jin et al. (Acta Math Appl Sin Engl Ser, 2015) introduced the number of maximum state circles of a plane graph G, denoted by $$s_{\max }(G)$$ s max ( G ) , and proved that $$s_{\max }(G)=\max \{e(H)+2c(H)-v(H)|$$ s max ( G ) = max { e ( H ) + 2 c ( H ) - v ( H ) | H is a spanning subgraph of $$G\}$$ G } , where e(H), c(H) and v(H) denote the size, the number of connected components and the order of H, respectively. In this paper, we show that for any (not necessarily planar) graph G, $$s_{\max }(G)$$ s max ( G ) can be achieved by the spanning subgraph H of G whose each connected component is a maximal subgraph of G with two edge-disjoint spanning trees. Such a spanning subgraph is proved to be unique and we present a polynomial-time algorithm to find such a spanning subgraph for any graph G.

Suggested Citation

  • Xiaoli Ma & Baoyindureng Wu & Xian’an Jin, 2018. "Edge-disjoint spanning trees and the number of maximum state circles of a graph," Journal of Combinatorial Optimization, Springer, vol. 35(4), pages 997-1008, May.
    • Handle: RePEc:spr:jcomop:v:35:y:2018:i:4:d:10.1007_s10878-018-0249-y
    DOI: 10.1007/s10878-018-0249-y
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10878-018-0249-y
    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-018-0249-y?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.

    References listed on IDEAS

    as
    1. James Roskind & Robert E. Tarjan, 1985. "A Note on Finding Minimum-Cost Edge-Disjoint Spanning Trees," Mathematics of Operations Research, INFORMS, vol. 10(4), pages 701-708, November.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Gimadi, Edward Kh., 2015. "Efficient algorithms with performance guarantees for some problems of finding several discrete disjoint subgraphs in complete weighted graph," Applied Mathematics and Computation, Elsevier, vol. 255(C), pages 84-91.
    2. T. Werth & H. Sperber & S. Krumke, 2014. "Computation of equilibria and the price of anarchy in bottleneck congestion games," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 22(4), pages 687-712, December.
    3. Chassein, André B. & Goerigk, Marc, 2015. "A new bound for the midpoint solution in minmax regret optimization with an application to the robust shortest path problem," European Journal of Operational Research, Elsevier, vol. 244(3), pages 739-747.

    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:35:y:2018:i:4:d:10.1007_s10878-018-0249-y. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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.