{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,18]],"date-time":"2026-01-18T09:01:44Z","timestamp":1768726904542,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642174575","type":"print"},{"value":"9783642174582","type":"electronic"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-17458-2_18","type":"book-chapter","created":{"date-parts":[[2010,12,15]],"date-time":"2010-12-15T06:12:57Z","timestamp":1292393577000},"page":"212-221","source":"Crossref","is-referenced-by-count":6,"title":["Cyclic Vertex Connectivity of Star Graphs"],"prefix":"10.1007","author":[{"given":"Zhihua","family":"Yu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Qinghai","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhao","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"18_CR1","unstructured":"Akers, S.B., Harel, D., Krishnamurthy, B.: The star graph: an attractive alternative to the n-cube. In: Proc. Int. Conf. Parallel Processing, pp. 393\u2013400 (1987)"},{"key":"18_CR2","doi-asserted-by":"publisher","first-page":"555","DOI":"10.1109\/12.21148","volume":"38","author":"S.B. Akers","year":"1989","unstructured":"Akers, S.B., Krishnamurthy, B.: A group-theoretic model for symmetric interconnection networks. IEEE Transactions on Computers\u00a038, 555\u2013566 (1989)","journal-title":"IEEE Transactions on Computers"},{"key":"18_CR3","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-349-03521-2","volume-title":"Graph theory with application","author":"J.A. Bondy","year":"1976","unstructured":"Bondy, J.A., Murty, U.S.R.: Graph theory with application. Macmillan, London (1976)"},{"key":"18_CR4","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1002\/net.10045","volume":"40","author":"E. Cheng","year":"2002","unstructured":"Cheng, E., Lipman, M.J.: Increasing the connectivity of the star graphs. Networks\u00a040, 165\u2013169 (2002)","journal-title":"Networks"},{"key":"18_CR5","first-page":"31","volume":"5","author":"K. Day","year":"1994","unstructured":"Day, K., Tripathi, A.: A comparative study of topological properties of hypercubes and star graphs. IEEE Trans. Comp.\u00a05, 31\u201338 (1994)","journal-title":"IEEE Trans. Comp."},{"key":"18_CR6","doi-asserted-by":"publisher","first-page":"1586","DOI":"10.1109\/12.42131","volume":"38","author":"A.H. Esfahanian","year":"1989","unstructured":"Esfahanian, A.H.: Generalized measures of fault tolerance with application to n-cube networks. IEEE Trans. Comp.\u00a038, 1586\u20131591 (1989)","journal-title":"IEEE Trans. Comp."},{"key":"18_CR7","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1002\/net.3230130303","volume":"13","author":"F. Harary","year":"1983","unstructured":"Harary, F.: Conditional connectivity. Networks\u00a013, 347\u2013357 (1983)","journal-title":"Networks"},{"key":"18_CR8","series-title":"NATO Advanced Science Institutes Series C, Mathematica and Physical Sciences","first-page":"167","volume-title":"Graph Symmetry","author":"M.C. Heydemann","year":"1996","unstructured":"Heydemann, M.C., Ducourthial, B.: Cayley graphs and interconnection networks. In: Hahn, G., Sabidussi, G. (eds.) Graph Symmetry, Montreal, PQ. NATO Advanced Science Institutes Series C, Mathematica and Physical Sciences, vol.\u00a0497, pp. 167\u2013224. Kluwer Academic Publishers, Dordrecht (1996)"},{"key":"18_CR9","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1016\/0012-365X(91)90227-S","volume":"96","author":"D.A. Holton","year":"1991","unstructured":"Holton, D.A., Lou, D., Plummer, M.D.: On the 2-extendability of plannar graphs. Discrete Math.\u00a096, 81\u201399 (1991)","journal-title":"Discrete Math."},{"key":"18_CR10","unstructured":"Hu, S.C., Yang, C.B.: Fault tolerance on star graphs. In: Proceedings of the First Aizu International Symposium on Parallel Algorithms\/Architecture Synthesis, pp. 176\u2013182 (1995)"},{"key":"18_CR11","doi-asserted-by":"publisher","first-page":"218","DOI":"10.1109\/12.262126","volume":"43","author":"S. Latifi","year":"1994","unstructured":"Latifi, S., Hegde, M., Pour, M.N.: Conditional connectivity measures for large multiprocessor systems. IEEE Trans. Comp.\u00a043, 218\u2013222 (1994)","journal-title":"IEEE Trans. Comp."},{"key":"18_CR12","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1016\/0012-365X(93)90229-M","volume":"112","author":"D. Lou","year":"1993","unstructured":"Lou, D., Holton, D.A.: Lower bound of cyclic edge connectivity for n-extendability of regular graphs. Discrete Math.\u00a0112, 139\u2013150 (1993)","journal-title":"Discrete Math."},{"key":"18_CR13","first-page":"481","volume":"45","author":"R. Nedela","year":"1995","unstructured":"Nedela, R., Skoviera, M.: Atoms of cyclic connectivity in cubic graphs. Math. Slovaca\u00a045, 481\u2013499 (1995)","journal-title":"Math. Slovaca"},{"key":"18_CR14","doi-asserted-by":"crossref","unstructured":"Plummer, M.D.: On the cyclic connectivity of planar graphs. Lecture Notes in Mathematics, vol.\u00a0303, pp. 235\u2013242 (1972)","DOI":"10.1007\/BFb0067376"},{"key":"18_CR15","doi-asserted-by":"crossref","first-page":"665","DOI":"10.1090\/S0002-9947-1984-0743738-4","volume":"284","author":"N. Robertson","year":"1984","unstructured":"Robertson, N.: Minimal cyclic-4-connected graphs. Trans. Amer. Math. Soc.\u00a0284, 665\u2013684 (1984)","journal-title":"Trans. Amer. Math. Soc."},{"key":"18_CR16","doi-asserted-by":"publisher","first-page":"501","DOI":"10.1017\/S0370164600044229","volume":"10","author":"P.G. Tait","year":"1880","unstructured":"Tait, P.G.: Remarks on the colouring of maps. Proc. Roy. Soc., Edinburgh\u00a010, 501\u2013503 (1880)","journal-title":"Proc. Roy. Soc., Edinburgh"},{"key":"18_CR17","doi-asserted-by":"publisher","first-page":"264","DOI":"10.1016\/j.aml.2008.03.021","volume":"22","author":"M. Wan","year":"2009","unstructured":"Wan, M., Zhang, Z.: A kind of conditional vertex connectivity of star graphs. Appl. Math. Letters\u00a022, 264\u2013267 (2009)","journal-title":"Appl. Math. Letters"},{"key":"18_CR18","doi-asserted-by":"publisher","first-page":"4555","DOI":"10.1016\/j.disc.2009.02.019","volume":"309","author":"B. Wang","year":"2009","unstructured":"Wang, B., Zhang, Z.: On cyclic edge-connectivity of transitive graphs. Discrete Math.\u00a0309, 4555\u20134563 (2009)","journal-title":"Discrete Math."},{"key":"18_CR19","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1016\/S0021-9800(70)80005-9","volume":"8","author":"M.E. Watkins","year":"1970","unstructured":"Watkins, M.E.: Connectivity of transitive graphs. J. Combin. Theory\u00a08, 23\u201329 (1970)","journal-title":"J. Combin. Theory"},{"key":"18_CR20","first-page":"41","volume":"30","author":"J.M. Xu","year":"2004","unstructured":"Xu, J.M., Liu, Q.: 2-restricted edge connectivity of vertex-transitive graphs. Australasian Journal of Combinatorics\u00a030, 41\u201349 (2004)","journal-title":"Australasian Journal of Combinatorics"},{"key":"18_CR21","volume-title":"Integer flows and cycle covers of graphs","author":"C.Q. Zhang","year":"1997","unstructured":"Zhang, C.Q.: Integer flows and cycle covers of graphs. Marcel Dekker Inc., New York (1997)"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Optimization and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-17458-2_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,4]],"date-time":"2023-06-04T09:56:36Z","timestamp":1685872596000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-17458-2_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642174575","9783642174582"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-17458-2_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010]]}}}