Tree t-Spanners of a Graph: Minimizing Maximum Distances Efficiently

  • Fernanda CoutoEmail author
  • Luís Felipe I. CunhaEmail author
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 11346)


A tree t-spanner of a graph G is a spanning subtree T in which the distance between any two adjacent vertices of G is at most t. The smallest t for which G has a tree t-spanner is the tree stretch index. The problem of determining the tree stretch index has been studied by: establishing lower and upper bounds, based, for instance, on the girth value and on the minimum diameter spanning tree problem, respectively; and presenting some classes for which t is a tight value. Moreover, in 1995, the computational complexities of determining whether \(t = 2\) or \(t \ge 4\) were settled to be polynomially time solvable and NP-complete, respectively, while deciding if \(t = 3\) still remains an open problem.

With respect to the computational complexity aspect of this problem, we present an inconsistence on the sufficient condition of tree 2-spanner admissible graphs. Moreover, while dealing with operations in graphs, we provide optimum tree t-spanners for 2 cycle-power graphs and for prism graphs, which are obtained from 2 cycle-power graphs after removing a perfect matching. Specifically, the stretch indexes for both classes are far from their girth’s natural lower bounds, and surprisingly, the parameter does not change after such a matching removal. We also present efficient strategies to obtain optimum tree t-spanners considering threshold graphs, split graphs, and generalized octahedral graphs. With this last result in addition to vertices addition operations and the tree decomposition of a cograph, we are able to present the stretch index for cographs.


Tree t-spanner Stretch index Lower bounds Generalized octahedral graph Cycle-power graph Prism graph Threshold graph Split graph Cograph 


  1. 1.
    Peleg, D., Ullman, J.D.: An optimal synchronizer for the hypercube. In: Proceedings of the 6th ACM Symposium on Principles of Distributed Computing, Vancouver, pp. 77–85 (1987)Google Scholar
  2. 2.
    Althöfer, I., Das, G., Dobkin, D., Joseph, D., Soares, J.: On sparse spanners of weighted graphs. Discrete Comput. Geom. 9(1), 81–100 (1993)MathSciNetCrossRefGoogle Scholar
  3. 3.
    Bhatt, S., Chung, F., Leighton, T., Rosenberg, A.: Optimal simulations of tree machines. In: 27th Annual Symposium on Foundations of Computer Science, pp. 274–282. IEEE (1986)Google Scholar
  4. 4.
    Cai, L., Corneil, D.G.: Tree spanners. SIAM J. Discrete Math. 8(3), 359–387 (1995)MathSciNetCrossRefGoogle Scholar
  5. 5.
    Bansal, N., et al.: Min-max graph partitioning and small set expansion. SIAM J. Comput. 43(2), 872–904 (2014)MathSciNetCrossRefGoogle Scholar
  6. 6.
    Lanctot, J.K., Li, M., Ma, B., Wang, S., Zhang, L.: Distinguishing string selection problems. Inf. Comput. 185(1), 41–55 (2003)MathSciNetCrossRefGoogle Scholar
  7. 7.
    Fekete, S.P., Kremer, J.: Tree spanners in planar graphs. Discrete Appl. Math. 108(1–2), 85–103 (2001)MathSciNetCrossRefGoogle Scholar
  8. 8.
    Brandstädt, A., Dragan, F.F., Le, H.-O., et al.: Tree spanners on chordal graphs: complexity and algorithms. Theor. Comput. Sci. 310(1–3), 329–354 (2004)MathSciNetCrossRefGoogle Scholar
  9. 9.
    Panda, B., Das, A.: Tree 3-spanners in 2-sep chordal graphs: characterization and algorithms. Discrete Appl. Math. 158(17), 1913–1935 (2010)MathSciNetCrossRefGoogle Scholar
  10. 10.
    West, D.B., et al.: Introduction to Graph Theory, vol. 2. Prentice Hall, Upper Saddle River (2001)Google Scholar
  11. 11.
    Bondy, J., Murty, U.: Graph Theory, vol. 44 (2008)CrossRefGoogle Scholar
  12. 12.
    Bondy, J.A., Murty, U.S.R., et al.: Graph Theory with Applications, vol. 290. Citeseer (1976)Google Scholar
  13. 13.
    Hassin, R., Tamir, A.: On the minimum diameter spanning tree problem. Inf. Process. Lett. 53(2), 109–111 (1995)MathSciNetCrossRefGoogle Scholar
  14. 14.
    Bondy, J.: Trigraphs. Discrete Math. 75(1–3), 69–79 (1989)MathSciNetCrossRefGoogle Scholar
  15. 15.
    Farber, M.: Characterizations of strongly chordal graphs. Discrete Math. 43(2–3), 173–189 (1983)MathSciNetCrossRefGoogle Scholar
  16. 16.
    Golumbic, M.C., Hammer, P.L.: Stability in circular arc graphs. J. Algorithm 9(3), 314–320 (1988)MathSciNetCrossRefGoogle Scholar
  17. 17.
    Pizaña, M.A.: The icosahedron is clique divergent. Discrete Math. 262(1–3), 229–239 (2003)MathSciNetCrossRefGoogle Scholar
  18. 18.
    Golumbic, M.C.: Algorithmic Graph Theory and Perfect Graphs, vol. 57. Elsevier (2004)Google Scholar
  19. 19.
    Spinrad, J.P.: Efficient Graph Representations: The Fields Institute for Research in Mathematical Sciences, vol. 19. American Mathematical Society (2003)Google Scholar

Copyright information

© Springer Nature Switzerland AG 2018

Authors and Affiliations

  1. 1.Universidade Federal Rural do Rio de JaneiroNova IguaçuBrazil
  2. 2.Universidade Federal FluminenseNiteróiBrazil
  3. 3.Universidade Federal do Rio de JaneiroRio de JaneiroBrazil

Personalised recommendations