{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,23]],"date-time":"2026-02-23T17:21:46Z","timestamp":1771867306336,"version":"3.50.1"},"reference-count":19,"publisher":"World Scientific Pub Co Pte Ltd","issue":"04","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Math. Algorithm. Appl."],"published-print":{"date-parts":[[2011,12]]},"abstract":"<jats:p>For a connected graph G, a vertex subset F \u2282 V(G) is a cyclic vertex-cut of G if G - F is disconnected and at least two of its components contain cycles. The cardinality of a minimum cyclic vertex-cut of G, denoted by \u03ba<jats:sub>c<\/jats:sub>(G), is the cyclic vertex-connectivity of G. In this paper, we show that for any integer n \u2265 4, the n-dimensional star graph SG<jats:sub>n<\/jats:sub>has \u03ba<jats:sub>c<\/jats:sub>(SG<jats:sub>n<\/jats:sub>) = 6(n - 3).<\/jats:p>","DOI":"10.1142\/s1793830911001322","type":"journal-article","created":{"date-parts":[[2012,1,4]],"date-time":"2012-01-04T19:00:28Z","timestamp":1325703628000},"page":"433-442","source":"Crossref","is-referenced-by-count":12,"title":["CYCLIC CONNECTIVITY OF STAR GRAPH"],"prefix":"10.1142","volume":"03","author":[{"given":"QINGHAI","family":"LIU","sequence":"first","affiliation":[{"name":"College of Mathematics and System Sciences, Xinjiang University, Urumqi, Xinjiang, 830046, P. R. China"}]},{"given":"ZHAO","family":"ZHANG","sequence":"additional","affiliation":[{"name":"College of Mathematics and System Sciences, Xinjiang University, Urumqi, Xinjiang, 830046, P. R. China"}]},{"given":"ZHIHUA","family":"YU","sequence":"additional","affiliation":[{"name":"College of Mathematics and System Sciences, Xinjiang University, Urumqi, Xinjiang, 830046, P. R. China"}]}],"member":"219","published-online":{"date-parts":[[2012,4,5]]},"reference":[{"key":"rf2","doi-asserted-by":"publisher","DOI":"10.1109\/12.21148"},{"key":"rf3","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-349-03521-2"},{"key":"rf4","doi-asserted-by":"publisher","DOI":"10.1002\/net.10045"},{"key":"rf5","first-page":"31","volume":"5","author":"Day K.","journal-title":"IEEE Trans. Comput."},{"key":"rf6","doi-asserted-by":"publisher","DOI":"10.1109\/12.42131"},{"key":"rf7","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230130303"},{"key":"rf8","doi-asserted-by":"publisher","DOI":"10.1007\/978-94-015-8937-6_5"},{"key":"rf9","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(91)90227-S"},{"key":"rf11","doi-asserted-by":"publisher","DOI":"10.1109\/12.262126"},{"key":"rf12","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(93)90229-M"},{"key":"rf13","first-page":"481","volume":"45","author":"Nedela R.","journal-title":"Math. Slovaca"},{"key":"rf14","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0067376"},{"key":"rf15","doi-asserted-by":"crossref","first-page":"665","DOI":"10.1090\/S0002-9947-1984-0743738-4","volume":"284","author":"Robertson N.","journal-title":"Trans. Am. Math. Soc."},{"key":"rf16","doi-asserted-by":"crossref","first-page":"501","DOI":"10.1017\/S0370164600044229","volume":"10","author":"Tait P. G.","journal-title":"Proc. Roy. Soc. Edinburgh"},{"key":"rf17","doi-asserted-by":"publisher","DOI":"10.1016\/j.aml.2008.03.021"},{"key":"rf18","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2009.02.019"},{"key":"rf19","doi-asserted-by":"publisher","DOI":"10.1016\/S0021-9800(70)80005-9"},{"key":"rf20","first-page":"41","volume":"30","author":"Xu J. M.","journal-title":"Australas. J. Combin."},{"key":"rf21","volume-title":"Integer Flows and Cycle Covers of Graphs","author":"Zhang C. Q.","year":"1997"}],"container-title":["Discrete Mathematics, Algorithms and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S1793830911001322","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,12,24]],"date-time":"2021-12-24T08:52:37Z","timestamp":1640335957000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S1793830911001322"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,12]]},"references-count":19,"journal-issue":{"issue":"04","published-online":{"date-parts":[[2012,4,5]]},"published-print":{"date-parts":[[2011,12]]}},"alternative-id":["10.1142\/S1793830911001322"],"URL":"https:\/\/doi.org\/10.1142\/s1793830911001322","relation":{},"ISSN":["1793-8309","1793-8317"],"issn-type":[{"value":"1793-8309","type":"print"},{"value":"1793-8317","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,12]]}}}