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

Xiaoli Ma, Baoyindureng Wu () and Xian’an Jin ()
Additional contact information
Xiaoli Ma: Xinjiang University
Baoyindureng Wu: Xinjiang University
Xian’an Jin: Xiamen University

Journal of Combinatorial Optimization, 2018, vol. 35, issue 4, No 1, 997-1008

Abstract: 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.

Keywords: Spanning trees; Polynomial-time algorithm; State circle; Link (search for similar items in EconPapers)
Date: 2018
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10878-018-0249-y Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jcomop:v:35:y:2018:i:4:d:10.1007_s10878-018-0249-y

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1007/s10878-018-0249-y

Access Statistics for this article

Journal of Combinatorial Optimization is currently edited by Thai, My T.

More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().