Abstract
This paper considers Rh-connectivity of the (n, k)-star graph Sn,k, denoted by κh(Sn,k). In this note, We determine κh(Sn,k) = n+h(k−2)−1 for 2 ≤ k ≤ n−1 and 0 ≤ h ≤ n−k. The results generalize the main result in proved by W. H. Yang et al. [Information Processing Letters, 110(2010), 1007–1011] for the R1-connectivity (κ1(Sn,k)) and R2-connectivity (κ2(Sn,k)).
Full Text
Sign-in/Register to access full text options
Published version (Free)
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
More From: International Journal of Foundations of Computer Science
Paper Title
Journal
Date