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)\), and proved that \(s_{\max }(G)=\max \{e(H)+2c(H)-v(H)|\) H is a spanning subgraph of \(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)\) 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.
Similar content being viewed by others
References
Bondy JA, Murty USR (1976) Graph theory with applications. The Macmillan Press Ltd, London
Cheng X, Liu S, Zhang H, Qiu W (2010) Fabrication of a family of pyramidal links and their genus. MATCH Commun Math Comput Chem 63:623–636
Clausen J, Hansen LA (1980) Finding \(k\) edge disjoint spanning trees of minimum total weight network: an application of matroid theory. Math Program Stud 13:88–101
Crowell RH (1959) Genus of alternating link types. Ann Math 69:258–275
Gabai D (1986) Genera of the alternating links. Duke Math J 53:677–681
Gusfield D (1983) Connectivity and edge-disjoint spanning trees. Inform Process Lett 16:87–89
Held M, Karp RM (1971) The traveling salesman and minimum spaning trees. Math Program 1:6–25
Hobbs M (1989) Computing edge-toughness and fractional arboricity. Contemp Math 89:89–106
Jin X, Ge J, Cheng X, Lin Y (2015) The number of circles of a maximum state of a plane graph with applications. Acta Math Appl Sin Engl Ser
Kundu S (1974) Bounds on the number of egde-disjoint spanning trees. J Comb Theory Ser B 17:199–203
Liu S, Zhang H (2012) Genera of the links derived from 2-connected plane graphs. J Knot Theory Ramif. 21:1250129
Murasugi K (1958) On the genus of the alternating knot, I, II. J Math Soc Jpn 10(94–105):235–248
Nakamura T, Nakanishi Y, Satoh S, Tomiyama Y (2014) The state numbers of virtual knot. J Knot Theory Ramif 23:1450016
Nash-Williams CSJA (1961) Edge-disjoint spanning trees of finite graphs. J Lond. Math Soc 36:445–450
Roskind J, Tarjan R (1985) A note on finding minimum-cost edge-disjoint spanning trees. Math Oper Res 10:701–708
Seifert H (1935) Über das Geschlecht von Knoten. Math Ann 110:571–592
Tarjan RE (1974) A good algorithm for edge-disjoint branching. Inform Process Lett 3:51–53
Tarjan RE (1976) Edge-disjoint spanning trees and depth-first search. Acta Inform 6:171–185
Thistlethwaite MB (1987) A spanning tree expansion of the Jones polynomial. Topology 26:297–309
Tutte WT (1961) On the problem of decomposing a graph into \(n\) connected factors. J Lond Math Soc 36:221–230
Yao AC (1975) An \(O(|E|log~log|V|)\) algorithm for finding minimum spanning trees. Inform Process Lett 4:21–23
Zhang C, Ou Y (2008) Clustering, community partition and disjoint spanning trees. ACM Trans Algorithms 4:35
Acknowledgements
We are grateful to the referees for their constructive comments which helped to improve the presentation of the paper. The first two authors are grateful to Professor C.Q. Zhang for sending the appendix of the paper (Zhang and Ou 2008). The third author thanks Professors F.M. Dong, Yuqing Lin, and Eri Matsudo for some helpful discussions. This works is also supported by President’s Funds of Xiamen University (No. 20720160011).
Author information
Authors and Affiliations
Corresponding author
Additional information
Research supported by NSFC (No. 11571294, 11671336)
Rights and permissions
About this article
Cite this article
Ma, X., Wu, B. & Jin, X. Edge-disjoint spanning trees and the number of maximum state circles of a graph. J Comb Optim 35, 997–1008 (2018). https://doi.org/10.1007/s10878-018-0249-y
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10878-018-0249-y