{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T03:05:03Z","timestamp":1740107103049,"version":"3.37.3"},"reference-count":30,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2021,6,15]],"date-time":"2021-06-15T00:00:00Z","timestamp":1623715200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,6,15]],"date-time":"2021-06-15T00:00:00Z","timestamp":1623715200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2021,11]]},"DOI":"10.1007\/s00373-021-02333-6","type":"journal-article","created":{"date-parts":[[2021,6,15]],"date-time":"2021-06-15T11:02:39Z","timestamp":1623754959000},"page":"2079-2093","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Spectral Threshold for Extremal Cyclic Edge-Connectivity"],"prefix":"10.1007","volume":"37","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3466-3334","authenticated-orcid":false,"given":"Sinan G.","family":"Aksoy","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mark","family":"Kempton","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stephen J.","family":"Young","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,6,15]]},"reference":[{"key":"2333_CR1","doi-asserted-by":"publisher","first-page":"428","DOI":"10.13001\/1081-3810.3675","volume":"34","author":"A Abiad","year":"2018","unstructured":"Abiad, A., Brimkov, B., Martinez-Rivera, X., Zhang, O.S.J.: Spectral bounds for the connectivity of regular graphs with given order. Electron. J. Linear Algebra 34, 428\u2013443 (2018)","journal-title":"Electron. J. Linear Algebra"},{"key":"2333_CR2","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1007\/s003730200002","volume":"18","author":"N Alon","year":"2002","unstructured":"Alon, N., Hoory, S., Linial, N.: The Moore bound for irregular graphs. Graphs Combin. 18, 53\u201357 (2002)","journal-title":"Graphs Combin."},{"key":"2333_CR3","volume-title":"Algebraic Graph Theory","author":"N Biggs","year":"1993","unstructured":"Biggs, N.: Algebraic Graph Theory, 2nd edn. Cambridge Mathematical Library, Cambridge University Press, Cambridge (1993)","edition":"2"},{"key":"2333_CR4","volume-title":"Large-Scale Networks, Theory and Design","author":"FT Boesch","year":"1976","unstructured":"Boesch, F.T.: Large-Scale Networks, Theory and Design. IEEE Press, New York (1976)"},{"key":"2333_CR5","volume-title":"Extremal Graph Theory","author":"B Bollob\u00e1s","year":"2004","unstructured":"Bollob\u00e1s, B.: Extremal Graph Theory. Dover Books on Mathematics, Mineola (2004)"},{"key":"2333_CR6","volume-title":"Graph Theory: (Graduate Texts in Mathematics)","author":"A Bondy","year":"2010","unstructured":"Bondy, A.: Graph Theory: (Graduate Texts in Mathematics). Springer, Berlin (2010)"},{"key":"2333_CR7","doi-asserted-by":"publisher","first-page":"458","DOI":"10.1016\/j.laa.2009.08.029","volume":"432","author":"SM Cioab\u0103","year":"2010","unstructured":"Cioab\u0103, S.M.: Eigenvalues and edge-connectivity of regular graphs. .Linear Algebra Appl. 432, 458\u2013470 (2010)","journal-title":".Linear Algebra Appl."},{"key":"2333_CR8","doi-asserted-by":"publisher","first-page":"904","DOI":"10.1016\/j.jcta.2012.01.001","volume":"119","author":"SM Cioab\u0103","year":"2012","unstructured":"Cioab\u0103, S.M., Kim, K., Koolen, J.H.: On a conjecture of Brouwer involving the connectivity of strongly regular graphs. J. Combin. Theory Ser. A 119, 904\u2013922 (2012)","journal-title":"J. Combin. Theory Ser. A"},{"key":"2333_CR9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ejc.2013.10.008","volume":"38","author":"SM Cioab\u0103","year":"2014","unstructured":"Cioab\u0103, S.M., Koolen, J., Li, W.: Disconnecting strongly regular graphs. Eur. J. Combin. 38, 1\u201311 (2014)","journal-title":"Eur. J. Combin."},{"key":"2333_CR10","doi-asserted-by":"publisher","first-page":"183","DOI":"10.4153\/CMB-1963-019-5","volume":"6","author":"GA Dirac","year":"1963","unstructured":"Dirac, G.A.: Some results concerning the structure of graphs. Can. Math. Bull. 6, 183\u2013210 (1963)","journal-title":"Can. Math. Bull."},{"key":"2333_CR11","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1016\/0012-365X(92)00475-7","volume":"127","author":"J F\u00e0brega","year":"1994","unstructured":"F\u00e0brega, J., Fiol, M.A.: Extraconnectivity of graphs with large girth. Discrete Math. 127, 163\u2013170 (1994)","journal-title":"Discrete Math."},{"key":"2333_CR12","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1016\/0095-8956(92)90069-A","volume":"54","author":"G Fan","year":"1992","unstructured":"Fan, G.: Integer flows and cycle covers. J. Combin. Theory Ser. B 54, 113\u2013122 (1992)","journal-title":"J. Combin. Theory Ser. B"},{"key":"2333_CR13","doi-asserted-by":"publisher","first-page":"298","DOI":"10.21136\/CMJ.1973.101168","volume":"23","author":"M Fiedler","year":"1973","unstructured":"Fiedler, M.: Algebraic connectivity of graphs. Czech. Math. J. 23, 298\u2013305 (1973)","journal-title":"Czech. Math. J."},{"key":"2333_CR14","volume-title":"Graduate Texts in Mathematics","author":"C Godsil","year":"2001","unstructured":"Godsil, C., Royle, G.: Algebraic graph theory. In: Graduate Texts in Mathematics, vol. 207. Springer, New York (2001)"},{"key":"2333_CR15","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 13, 347\u2013357 (1983)","journal-title":"Networks"},{"key":"2333_CR16","doi-asserted-by":"publisher","first-page":"218","DOI":"10.1109\/12.262126","volume":"43","author":"S Latifi","year":"1994","unstructured":"Latifi, S., Hegde, M., Naraghi-Pour, M.: Conditional connectivity measures for large multiprocessor systems. IEEE Trans. Comput. 43, 218\u2013222 (1994)","journal-title":"IEEE Trans. Comput."},{"key":"2333_CR17","doi-asserted-by":"crossref","unstructured":"Liang, J., Du, M., Nie, R., Liang, Z., Li, Z.: Distributed algorithms for cyclic edge connectivity and cyclic vertex connectivity of cubic graphs. In: Proceedings of the 2020 4th International Conference on Digital Signal Processing, 2020, pp.\u00a0279\u2013283 (2020)","DOI":"10.1145\/3408127.3408196"},{"key":"2333_CR18","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1137\/0136016","volume":"36","author":"RJ Lipton","year":"1979","unstructured":"Lipton, R.J., Tarjan, R.E.: A separator theorem for planar graphs. SIAM J. Appl. Math. 36, 177\u2013189 (1979)","journal-title":"SIAM J. Appl. Math."},{"key":"2333_CR19","doi-asserted-by":"publisher","first-page":"516","DOI":"10.1016\/j.dam.2009.10.017","volume":"158","author":"Q Liu","year":"2010","unstructured":"Liu, Q., Zhang, Z.: The existence and upper bound for two types of restricted connectivity. Discrete Appl. Math. 158, 516\u2013521 (2010)","journal-title":"Discrete Appl. Math."},{"key":"2333_CR20","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. 112, 139\u2013150 (1993)","journal-title":"Discrete Math."},{"key":"2333_CR21","first-page":"311","volume":"77","author":"D Lou","year":"2005","unstructured":"Lou, D., Wang, W.: An efficient algorithm for cyclic edge connectivity of regular graphs. Ars Combin. 77, 311\u2013318 (2005)","journal-title":"Ars Combin."},{"key":"2333_CR22","doi-asserted-by":"publisher","first-page":"2094","DOI":"10.1016\/j.disc.2007.04.055","volume":"308","author":"D Lou","year":"2008","unstructured":"Lou, D., Wang, W.: Characterization of graphs with infinite cyclic edge connectivity. Discrete Math. 308, 2094\u20132103 (2008)","journal-title":"Discrete Math."},{"key":"2333_CR23","first-page":"289","volume":"16","author":"L Lov\u00e1sz","year":"1965","unstructured":"Lov\u00e1sz, L.: On graphs not containing independent circuits. Mat. Lapok 16, 289\u2013299 (1965)","journal-title":"Mat. Lapok"},{"key":"2333_CR24","doi-asserted-by":"crossref","unstructured":"Mohar, B.: Some applications of Laplace eigenvalues of graphs. In: Graph Symmetry, pp.\u00a0225\u2013275. Springer (1997)","DOI":"10.1007\/978-94-015-8937-6_6"},{"key":"2333_CR25","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1016\/0012-365X(83)90121-8","volume":"46","author":"B Peroche","year":"1983","unstructured":"Peroche, B.: On several sorts of connectivity. Discrete Math. 46, 267\u2013277 (1983)","journal-title":"Discrete Math."},{"key":"2333_CR26","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1016\/0012-365X(80)90037-0","volume":"31","author":"MD Plummer","year":"1980","unstructured":"Plummer, M.D.: On n-extendable graphs. Discrete Math. 31, 201\u2013210 (1980)","journal-title":"Discrete Math."},{"key":"2333_CR27","doi-asserted-by":"publisher","first-page":"281","DOI":"10.2307\/2303897","volume":"46","author":"HE Robbins","year":"1939","unstructured":"Robbins, H.E.: A theorem on graphs, with an application to a problem of traffic control. Am. Math. Mon. 46, 281\u2013283 (1939)","journal-title":"Am. Math. Mon."},{"key":"2333_CR28","doi-asserted-by":"publisher","first-page":"501","DOI":"10.1017\/S0370164600044229","volume":"10","author":"PG Tait","year":"1880","unstructured":"Tait, P.G.: Remarks on the colouring of maps. Proc. R. Soc. Edinb. 10, 501\u2013503 (1880)","journal-title":"Proc. R. Soc. Edinb."},{"key":"2333_CR29","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. 309, 4555\u20134563 (2009)","journal-title":"Discrete Math."},{"key":"2333_CR30","doi-asserted-by":"publisher","first-page":"779","DOI":"10.1007\/s00373-019-02031-4","volume":"35","author":"W Zhang","year":"2019","unstructured":"Zhang, W.: The cyclic edge-connectivity of strongly regular graphs. Graphs Combin. 35, 779\u2013785 (2019)","journal-title":"Graphs Combin."}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-021-02333-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00373-021-02333-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-021-02333-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,11,13]],"date-time":"2021-11-13T21:27:51Z","timestamp":1636838871000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00373-021-02333-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,6,15]]},"references-count":30,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2021,11]]}},"alternative-id":["2333"],"URL":"https:\/\/doi.org\/10.1007\/s00373-021-02333-6","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"type":"print","value":"0911-0119"},{"type":"electronic","value":"1435-5914"}],"subject":[],"published":{"date-parts":[[2021,6,15]]},"assertion":[{"value":"16 April 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 March 2021","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 May 2021","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 June 2021","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"This work was supported by the High Performance Data Analytics (HPDA) program at Pacific Northwest National Laboratory. Pacific Northwest National Laboratory is operated by Battelle Memorial Institute under Contract DE-ACO6-76RL01830. <i>PNNL Information Release:<\/i> PNNL-SA-151831 . The authors declare they have no competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing Interests"}}]}}