Abstract
Completely independent spanning trees \(T_1,T_2,\ldots ,T_k\) in a graph G are spanning trees in G such that for any pair of distinct vertices u and v, the k paths in the spanning trees between u and v mutually have no common edge and no common vertex except for u and v. The concept finds applications in fault-tolerant communication problems in a network. Recently, it was shown that Dirac’s condition for a graph to be hamiltonian is also a sufficient condition for a graph to have two completely independent spanning trees. In this paper, we generalize this result to three or more completely independent spanning trees. Namely, we show that for any graph G with \(n \ge 7\) vertices, if the minimum degree of a vertex in G is at least \(n-k\), where \(3 \le k \le \frac{n}{2}\), then there are \(\lfloor \frac{n}{k} \rfloor \) completely independent spanning trees in G. Besides, we improve the lower bound of \(\frac{n}{2}\) on the Dirac’s condition for completely independent spanning trees to \(\frac{n-1}{2}\) except for some specific graph. Our results are theoretical ones, since these minimum degree conditions can be applied only to a very dense graph. We then present constructions of symmetric regular graphs which include optimal graphs with respect to the number of completely independent spanning trees.
This work was supported by JSPS KAKENHI 25330015.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Araki, T.: Dirac’s condition for completely independent spanning trees. J. Graph Theory 77, 171–179 (2014)
Chang, H.-Y., Wang, H.-L., Yang, J.-S., Chang, J.-M.: A note on the degree condition of completely independent spanning trees. IEICE Trans. 98–A, 2191–2193 (2015)
Curran, S., Lee, O., Yu, X.: Finding four independent trees. SIAM J. Comput. 35, 1023–1058 (2006)
Fan, G., Hong, Y., Liu, Q.: Ore’s condition for completely independent spanning trees. Discrete Appl. Math. 177, 95–100 (2014)
Hasunuma, T.: Completely independent spanning trees in the underlying graph of a line digraph. Discrete Math. 234, 149–157 (2001)
Hasunuma, T.: Completely independent spanning trees in maximal planar graphs. In: Kučera, L. (ed.) WG 2002. LNCS, vol. 2573, pp. 235–245. Springer, Heidelberg (2002)
Hasunuma, T.: Structural properties of subdivided-line graphs. J. Discrete Algorithms 31, 69–86 (2015)
Hasunuma, T., Morisaka, C.: Completely independent spanning trees in torus networks. Networks 60, 59–69 (2012)
Hasunuma, T., Nagamochi, H.: Independent spanning trees with small depths in iterated line digraphs. Discrete Appl. Math. 110, 189–211 (2001)
Huck, A.: Independent trees in graphs. Graphs Combin. 10, 29–45 (1994)
Jackson, B.: Hamilton cycles in regular 2-connected graphs. J. Combin. Theory B 29, 27–46 (1980)
Pai, K.-J., Yang, J.-S., Yao, S.-C., Tang, S.-M., Chang, J.-M.: Completely independent spanning trees on some interconnection networks. IEICE Trans. 97–D, 2514–2517 (2014)
Péterfalvi, F.: Two counterexamples on completely independent spanning trees. Discrete Math. 312, 808–810 (2012)
Tang, S.-M., Yang, J.-S., Wang, Y.-L., Chang, J.-M.: Independent spanning trees on multidimensional torus networks. IEEE Trans. Comput. 59, 93–102 (2010)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer International Publishing Switzerland
About this paper
Cite this paper
Hasunuma, T. (2016). Minimum Degree Conditions and Optimal Graphs for Completely Independent Spanning Trees. In: Lipták, Z., Smyth, W. (eds) Combinatorial Algorithms. IWOCA 2015. Lecture Notes in Computer Science(), vol 9538. Springer, Cham. https://doi.org/10.1007/978-3-319-29516-9_22
Download citation
DOI: https://doi.org/10.1007/978-3-319-29516-9_22
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-29515-2
Online ISBN: 978-3-319-29516-9
eBook Packages: Computer ScienceComputer Science (R0)