Generalized Measures of Fault Tolerance in (n,k)-star Graphs

Details Generalized Measures of Fault Tolerance in (n,k)-star Graphs Generalized Measures of Fault Tolerance in (n,k)-star Graphs

2012-04-06

arxiv.org/abs/1204.1440v1

Mathematics

Combinatorics

7 page, 9 references

Scientific paper

This paper considers a kind of generalized measure $\kappa_s^{(h)}$ of fault tolerance in the $(n,k)$-star graph $S_{n,k}$ and determines $\kappa_s^{(h)}(S_{n,k})=n+h(k-2)-1$ for $2 \leqslant k \leqslant n-1$ and $0\leqslant h \leqslant n-k$, which implies that at least $n+h(k-2)-1$ vertices of $S_{n,k}$ have to remove to get a disconnected graph that contains no vertices of degree less than $h$. This result contains some known results such as Yang et al. [Information Processing Letters, 110 (2010), 1007-1011].

Affiliated with

Also associated with

No associations

Rating

Generalized Measures of Fault Tolerance in (n,k)-star Graphs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Generalized Measures of Fault Tolerance in (n,k)-star Graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Generalized Measures of Fault Tolerance in (n,k)-star Graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-183508