L. W. Beineke and R. J. Wilson, Topics in Structural Graph Theory, 2013.

A. Blasiak, R. Kleinberg, and E. Lubetzky, Lexicographic Products and the Power of Non-linear Network Coding, 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science, 2013.
DOI : 10.1109/FOCS.2011.39

G. Chartrand, F. Okamoto, and P. Zhang, Rainbow trees in graphs and generalized connectivity, Networks, vol.54, issue.4, pp.360-367, 2010.
DOI : 10.1002/net.20339

X. Cheng and D. Du, Steiner Trees in Industry, 2001.

D. P. Day, O. R. Oellermann, and H. C. Swart, The -connectivity function of trees and complete multipartite graphs, J. Combin. Math. Combin. Comput, vol.10, pp.183-192, 1991.

K. Day and A. E. , The cross product of interconnection networks, IEEE Transactions on Parallel and Distributed Systems, vol.8, issue.2, pp.109-118, 1997.
DOI : 10.1109/71.577251

M. Feng, M. Xu, and K. Wang, Identifying codes of lexicographic product of graphs, Electron, J. Combin, vol.19, issue.4, pp.56-63, 2012.

P. Fragopoulou and S. G. , Edge-disjoint spanning trees on the star network with applications to fault tolerance, IEEE Transactions on Computers, vol.45, issue.2, pp.174-185, 1996.
DOI : 10.1109/12.485370

M. Grötschel, A. Martin, and R. , Packing Steiner trees: a cutting plane algorithm and computational results, Mathematical Programming, vol.6, issue.2, pp.125-145, 1996.
DOI : 10.1007/BF02592086

R. Gu, X. Li, and Y. Shi, The generalized 3-connectivity of random graphs, Chinese), pp.321-330, 2014.

M. Hager, Pendant tree-connectivity, Journal of Combinatorial Theory, Series B, vol.38, issue.2, pp.179-189, 1985.
DOI : 10.1016/0095-8956(85)90083-8

M. Hager, Path-connectivity in graphs, Discrete Math, pp.53-59, 1986.

R. Hammack and W. Imrich, Sandi Klav? zr, Handbook of Product Graphs, 2011.

H. R. Hind and O. R. Oellermann, Menger-type results for three or more vertices, Congressus Numerantium, vol.113, pp.179-204, 1996.

A. Itai and M. Rodeh, The multi-tree approach to reliability in distributed networks, Information and Computation, vol.79, issue.1, pp.43-59, 1988.
DOI : 10.1016/0890-5401(88)90016-8

S. Ku, B. Wang, and T. Hung, Constructing edge-disjoint spanning trees in product networks, Parallel and Distributed Systems, IEEE Trans. Parallel and Disjoited Systems, vol.14, issue.3, pp.213-221, 2003.

F. Li, Z. Xu, H. Zhao, and W. Wang, On the number of spanning trees of the lexicographic product of networks, pp.949-959, 2012.

H. Li, X. Li, and Y. Mao, On extremal graphs with at most two internally disjoint Steiner trees connecting any three vertices, Bull. Malays. Math. Sci. Soc

H. Li, X. Li, and Y. Sun, The generalied 3-connectivity of Cartesian product graphs, Discrete Math, Theor. Comput. Sci, vol.14, issue.1, pp.43-54, 2012.

S. Li, W. Li, and X. Li, The generalized connectivity of complete bipartite graphs, Ars Combin, vol.104, pp.65-79, 2012.

S. Li, W. Li, and X. Li, The generalized connectivity of complete equipartition 3-partite graphs, Bull. Malays. Math. Sci. Soc, vol.37, issue.21, pp.103-121, 2014.

S. Li and X. Li, Note on the hardness of generalized connectivity, Journal of Combinatorial Optimization, vol.54, issue.4, pp.389-396, 2012.
DOI : 10.1007/s10878-011-9399-x

X. Li and Y. Mao, On Extremal Graphs with at Most $$\ell $$ ??? Internally Disjoint Steiner Trees Connecting Any $$n-1$$ n - 1 Vertices, Graphs and Combinatorics, vol.102, issue.2
DOI : 10.1007/s00373-014-1500-7

X. Li, Y. Mao, and Y. Sun, Graphs with large generalized (edge-)connectivity, Discussiones Mathematicae Graph Theory, vol.36, issue.4, pp.304-319, 2014.
DOI : 10.7151/dmgt.1907
URL : http://doi.org/10.7151/dmgt.1907

C. J. St and . Nash-williams, Edge-disjonint spanning trees of finite graphs, J. London Math. Soc, vol.36, pp.445-450, 1961.

O. R. Oellermann, Connectivity and edge-connectivity in graphs: A survey, Congessus Numerantium, vol.116, pp.231-252, 1996.

O. R. Oellermann, On thel-connectivity of a graph, Graphs and Combinatorics, vol.54, issue.1, pp.285-299, 1987.
DOI : 10.1007/BF01788551

O. R. Oellermann, A note on the -connectivity function of a graph, Congessus Numerantium, vol.60, pp.181-188, 1987.

F. Okamoto and P. Zhang, The tree connectivity of regular complete bipartite graphs, J. Combin. Math. Combin. Comput, vol.74, pp.279-293, 2010.

K. Ozeki and T. Yamashita, Spanning Trees: A Survey, Graphs and Combinatorics, vol.99, issue.198, pp.1-26, 2011.
DOI : 10.1007/s00373-010-0973-2

E. Palmer, On the spanning tree packing number of a graph: a survey, Discrete Mathematics, vol.230, issue.1-3, pp.13-21, 2001.
DOI : 10.1016/S0012-365X(00)00066-2

G. Sabidussi, Graphs with given group and given graph-theoretical properties, Journal canadien de math??matiques, vol.9, issue.0, pp.515-525, 1957.
DOI : 10.4153/CJM-1957-060-7

N. A. Sherwani, Algorithms for V LSI Physical Design Automation, 1999.

S. Spacapan, Connectivity of Cartesian products of graphs, Applied Mathematics Letters, vol.21, issue.7, pp.682-685, 2008.
DOI : 10.1016/j.aml.2007.06.010

D. West, Introduction to Graph Theory, 2001.

H. Whitney, Congruent Graphs and the Connectivity of Graphs, American Journal of Mathematics, vol.54, issue.1, pp.150-168, 1932.
DOI : 10.2307/2371086

C. Yang and J. Xu, Connectivity of lexicographic product and direct product of graphs, Ars Combin, vol.111, pp.3-12, 2013.