{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,28]],"date-time":"2026-05-28T02:17:19Z","timestamp":1779934639486,"version":"3.53.1"},"reference-count":21,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2017,7,27]],"date-time":"2017-07-27T00:00:00Z","timestamp":1501113600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2017,9]]},"DOI":"10.1007\/s00373-017-1837-9","type":"journal-article","created":{"date-parts":[[2017,7,27]],"date-time":"2017-07-27T19:36:23Z","timestamp":1501184183000},"page":"1195-1209","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":44,"title":["The Generalized 3-Connectivity of Cayley Graphs on Symmetric Groups Generated by Trees and Cycles"],"prefix":"10.1007","volume":"33","author":[{"given":"Shasha","family":"Li","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yongtang","family":"Shi","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jianhua","family":"Tu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2017,7,27]]},"reference":[{"key":"1837_CR1","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-84628-970-5","volume-title":"Graph Theory, GTM 244","author":"JA Bondy","year":"2008","unstructured":"Bondy, J.A., Murty, U.S.R.: Graph Theory, GTM 244. Springer, Berlin (2008)"},{"key":"1837_CR2","doi-asserted-by":"crossref","first-page":"2662","DOI":"10.1016\/j.camwa.2007.10.016","volume":"55","author":"E Cheng","year":"2008","unstructured":"Cheng, E., Lipt\u00e1cute\u00e1k, L., Shawash, N.: Orienting Cayley graphs generated by transposition trees. Comput. Math. Appl. 55, 2662\u20132672 (2008)","journal-title":"Comput. Math. Appl."},{"key":"1837_CR3","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4613-0163-9","volume-title":"Algebraic Graph Theory","author":"C Godsil","year":"2001","unstructured":"Godsil, C., Royle, G.F.: Algebraic Graph Theory. Springer, Berlin (2001)"},{"key":"1837_CR4","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1016\/0095-8956(85)90083-8","volume":"38","author":"M Hager","year":"1985","unstructured":"Hager, M.: Pendant tree-connectivity. J. Combin. Theory 38, 179\u2013189 (1985)","journal-title":"J. Combin. Theory"},{"key":"1837_CR5","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1016\/0012-365X(86)90068-3","volume":"59","author":"M Hager","year":"1986","unstructured":"Hager, M.: Path-connectivity in graphs. Discrete Math. 59, 53\u201359 (1986)","journal-title":"Discrete Math."},{"key":"1837_CR6","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1007\/978-94-015-8937-6_5","volume-title":"Graph Symmetry","author":"M Heydemann","year":"1997","unstructured":"Heydemann, M.: Cayley graphs and interconnection networks. In: Hahn, G., Sabidussi, G. (eds.) Graph Symmetry, pp. 167\u2013224. Kluwer Academic Publishers, The Netherlands (1997)"},{"key":"1837_CR7","doi-asserted-by":"crossref","first-page":"361","DOI":"10.1016\/0167-8191(93)90054-O","volume":"19","author":"S Lakshmivarahan","year":"1993","unstructured":"Lakshmivarahan, S., Jwo, J., Dhall, S.K.: Symmetry in interconnection networks based on Cayley graphs of permutation groups: a survey. Parallel Comput. 19, 361\u2013407 (1993)","journal-title":"Parallel Comput."},{"key":"1837_CR8","first-page":"155","volume":"258","author":"S Li","year":"2015","unstructured":"Li, S., Li, X., Shi, Y.: Note on the complexity of deciding the rainbow (vertex-)connectedness for bipartite graphs. Appl. Math. Comput. 258, 155\u2013161 (2015)","journal-title":"Appl. Math. Comput."},{"key":"1837_CR9","doi-asserted-by":"crossref","first-page":"389","DOI":"10.1007\/s10878-011-9399-x","volume":"24","author":"S Li","year":"2012","unstructured":"Li, S., Li, X.: Note on the hardness of generalized connectivity. J. Comb. Optim. 24, 389\u2013396 (2012)","journal-title":"J. Comb. Optim."},{"key":"1837_CR10","first-page":"65","volume":"104","author":"S Li","year":"2012","unstructured":"Li, S., Li, W., Li, X.: The generalized connectivity of complete bipartite graphs. Ars Combin. 104, 65\u201379 (2012)","journal-title":"Ars Combin."},{"issue":"1","key":"1837_CR11","first-page":"103","volume":"37","author":"S Li","year":"2014","unstructured":"Li, S., Li, W., Li, X.: The generalized connectivity of complete equipartition $$3$$ 3 -partite graphs. Bull. Malays. Math. Sci. Soc. 37(1), 103\u2013121 (2014)","journal-title":"Bull. Malays. Math. Sci. Soc."},{"key":"1837_CR12","first-page":"193","volume":"114","author":"H Li","year":"2014","unstructured":"Li, H., Li, X., Mao, Y., Sun, Y.: Note on the generalized connectivity. Ars Combin. 114, 193\u2013202 (2014)","journal-title":"Ars Combin."},{"issue":"1","key":"1837_CR13","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1007\/s10878-016-0075-z","volume":"34","author":"S Li","year":"2017","unstructured":"Li, S., Li, W., Shi, Y., Sun, H.: On minimally 2-connected graphs with generalized connectivity $$\\kappa _3=2$$ \u03ba 3 = 2 . J. Combin. Optimization 34(1), 141\u2013164 (2017)","journal-title":"J. Combin. Optimization"},{"issue":"1","key":"1837_CR14","first-page":"43","volume":"14","author":"H Li","year":"2012","unstructured":"Li, H., Li, X., Sun, Y.: The generalized $$3$$ 3 -connectivity of Cartesian product graphs. Discrete Math. Theor. Comput. 14(1), 43\u201354 (2012)","journal-title":"Discrete Math. Theor. Comput."},{"key":"1837_CR15","doi-asserted-by":"crossref","first-page":"2147","DOI":"10.1016\/j.disc.2010.04.011","volume":"310","author":"S Li","year":"2010","unstructured":"Li, S., Li, X., Zhou, W.: Sharp bounds for the generalized connectivity $$\\kappa _3(G)$$ \u03ba 3 ( G ) . Discrete Math. 310, 2147\u20132163 (2010)","journal-title":"Discrete Math."},{"key":"1837_CR16","unstructured":"Li, X., Mao, Y.: A survey on the generalized connectivity of graphs. arXiv:1207.1838v9"},{"key":"1837_CR17","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1016\/j.amc.2015.11.016","volume":"274","author":"S Li","year":"2016","unstructured":"Li, S., Tu, J., Yu, C.: The generalized 3-connectivity of star graphs and bubble-sort graphs. Appl. Math. Comput. 274, 41\u201346 (2016)","journal-title":"Appl. Math. Comput."},{"issue":"2","key":"1837_CR18","doi-asserted-by":"crossref","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. Lett. 22(2), 264\u2013267 (2009)","journal-title":"Appl. Math. Lett."},{"key":"1837_CR19","doi-asserted-by":"crossref","first-page":"150","DOI":"10.2307\/2371086","volume":"54","author":"H Whitney","year":"1932","unstructured":"Whitney, H.: Congruent graphs and the connectivity of graphs and the connectivity of graphs. Am. J. Math. 54, 150\u2013168 (1932)","journal-title":"Am. J. Math."},{"key":"1837_CR20","doi-asserted-by":"crossref","first-page":"1027","DOI":"10.1016\/j.ipl.2010.09.001","volume":"110","author":"W Yang","year":"2010","unstructured":"Yang, W., Li, H., Meng, J.: Conditional connectivity of Cayley graphs generated by transposition trees. Inf. Process. Lett. 110, 1027\u20131030 (2010)","journal-title":"Inf. Process. Lett."},{"key":"1837_CR21","doi-asserted-by":"crossref","first-page":"86","DOI":"10.1016\/j.ins.2013.04.011","volume":"243","author":"X Yu","year":"2013","unstructured":"Yu, X., Huang, X., Zhang, Z.: A kind of conditional connectivity of Cayley graphs generated by unicyclic graphs. Inf. Sci. 243, 86\u201394 (2013)","journal-title":"Inf. Sci."}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-017-1837-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-017-1837-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-017-1837-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,31]],"date-time":"2022-07-31T15:14:19Z","timestamp":1659280459000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-017-1837-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,7,27]]},"references-count":21,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2017,9]]}},"alternative-id":["1837"],"URL":"https:\/\/doi.org\/10.1007\/s00373-017-1837-9","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,7,27]]}}}