4.3 Article

The generalized connectivity of alternating group graphs and (n, k)-star graphs

Journal

DISCRETE APPLIED MATHEMATICS
Volume 251, Issue -, Pages 310-321

Publisher

ELSEVIER SCIENCE BV
DOI: 10.1016/j.dam.2018.05.059

Keywords

Generalized connectivity; Fault-tolerance; Alternating group graph; (n, k)-star graph

Funding

  1. National Natural Science Foundation of China [11731002]
  2. Fundamental Research Funds for the Central Universities [2016JBM071, 2016JBZ012]
  3. 111 Project of China [B16002]

Ask authors/readers for more resources

Let S subset of V(G) and kappa(G)(S) denote the maximum number r of edge-disjoint trees T-1, T-2, ..., T-r in G such that V(T-i) boolean AND V(T-j) = S for any i, j is an element of{1, 2, ..., r} and i not equal j. For an integer k with 2 <= k <= n, the generalized k-connectivity of a graph G is defined as kappa(k)(G) = min{kappa(G)(S)vertical bar S subset of V(G) and vertical bar S vertical bar = k}. The generalized k-connectivity is a generalization of traditional connectivity. In this paper, we focus on the alternating group graphs and (n, k)-star graphs, denoted by AG(n) and S-n,S-k, respectively. We study the generalized 3-connectivity of the two kinds of graphs and show that kappa(3)(AG(n)) = 2n - 5 for n >= 4 and kappa(3)(S-n,S-k) = n - 2 for n >= k + 1 and k >= 4, which generalize the known result about star graphs given by Li et al. (2016). In addition, as the alternating group network AN(n) is isomorphic to S-n,S-k for k = n - 2, the generalized 3-connectivity of AN(n) for n >= 6 can be obtained directly. (C) 2018 Elsevier B.V. All rights reserved.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.3
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
No Data Available