Generalized Connectivity of Star Graphs

MaRDI QIDQ6239122zbMATH OpenFDO

Authors Xiang-Jun Li, Jun-Ming Xu

Publication date 28 January 2013

Mathematics Subject Classification ID

Connectivity (05C40) Reliability, testing and fault tolerance of networks and computer systems (68M15) Graph theory (including graph drawing) in computer science (68R10)

Abstract: This paper shows that, for any integers $n$ and $k$ with $0leqslantkleqslantn-2$, at least $(k+1)!(n-k-1)$ vertices or edges have to be removed from an $n$-dimensional star graph to make it disconnected and no vertices of degree less than $k$. The result gives an affirmative answer to the conjecture proposed by Wan and Zhang [Applied Mathematics Letters, 22 (2009), 264-267].

This page was built for publication: Generalized Connectivity of Star Graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6239122)