Affiliation:
1. School of Mathematics and Statistics, Xidian University, Xi’an 710071, China
2. Laboratoire Interdisciplinaire des Sciences du Numérique, UMR9015 CNRS-Université Paris-Saclay, 1 Rue Raimond Castaing, 91190 Gif-sur-Yvette, France
Abstract
For S⊆V(G),κG(S) denotes the maximum number k of edge disjoint trees T1,T2,…,Tk in G, such that V(Ti)∩V(Tj)=S for any i,j∈{1,2,…,k} and i≠j. For an integer 2≤r≤|V(G)|, the generalized r-connectivity of G is defined as κr(G)=min{κG(S)|S⊆V(G)and|S|=r}. In fact, κ2(G) is the traditional connectivity of G. Hence, the generalized r-connectivity is an extension of traditional connectivity. The exchanged folded hypercube EFH(s,t), in which s≥1 and t≥1 are positive integers, is a variant of the hypercube. In this paper, we find that κ3(EFH(s,t))=s+1 with 3≤s≤t.
Funder
Natural Science Basic Research Program of Shaanxi
Fundamental Research Fund for the Central Universities
Reference18 articles.
1. Bondy, J.A., and Murty, U.S.R. (1976). Graph Theory with Applications, Elsevier.
2. Congruent graphs and the connectivity of graphs and the connectivity of graphs;Whitney;Am. J. Math.,1932
3. Generalized connectivity in graphs;Chartrand;Bull. Bombay Math. Colloq.,1984
4. Du, D., and Hu, X. (2008). Steiner Tree Problem in Computer Communication Networks, World Scientific.
5. Sherwani, N.A. (1999). Algorithms for VLSI Physical Design Automation, Kluwer Academic Publication. [3rd ed.].