{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:15:24Z","timestamp":1759637724407},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2014,5,15]],"date-time":"2014-05-15T00:00:00Z","timestamp":1400112000000},"content-version":"tdm","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":[[2015,9]]},"DOI":"10.1007\/s00373-014-1437-x","type":"journal-article","created":{"date-parts":[[2014,5,14]],"date-time":"2014-05-14T03:23:23Z","timestamp":1400037803000},"page":"1727-1737","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":11,"title":["Restricted Connectivity for Some Interconnection Networks"],"prefix":"10.1007","volume":"31","author":[{"given":"Yingzhi","family":"Tian","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jixiang","family":"Meng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2014,5,15]]},"reference":[{"key":"1437_CR1","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1002\/net.3230100206","volume":"10","author":"MO Ball","year":"1980","unstructured":"Ball, M.O.: Complexity of network reliability computation. Networks 10, 153\u2013165 (1980)","journal-title":"Networks"},{"key":"1437_CR2","doi-asserted-by":"crossref","first-page":"339","DOI":"10.1002\/jgt.3190100311","volume":"10","author":"F Boesch","year":"1986","unstructured":"Boesch, F.: On unreliability polynomials and graph connectivity in reliable network synthesis. J. Graph Theory 10, 339\u2013352 (1986)","journal-title":"J. Graph Theory"},{"key":"1437_CR3","doi-asserted-by":"crossref","first-page":"240","DOI":"10.1109\/TR.1986.4335424","volume":"35","author":"F Boesch","year":"1986","unstructured":"Boesch, F.: Synthesis of reliable networks\u2014a survey. IEEE Trans. Reliab. 35, 240\u2013246 (1986)","journal-title":"IEEE Trans. Reliab."},{"key":"1437_CR4","doi-asserted-by":"crossref","first-page":"487","DOI":"10.1002\/jgt.3190080406","volume":"8","author":"F Boesch","year":"1984","unstructured":"Boesch, F., Tindell, R.: Circulants and their connectivities. J. Graph Theory 8, 487\u2013499 (1984)","journal-title":"J. Graph Theory"},{"key":"1437_CR5","doi-asserted-by":"crossref","unstructured":"Bondy, J.A., Murty, U.S.R.: Graph Theory, Graduate Texts in Mathematics, vol. 244. Springer, Berlin (2008)","DOI":"10.1007\/978-1-84628-970-5"},{"key":"1437_CR6","volume-title":"The Combinatorics of Network Reliability","author":"CJ Colbourn","year":"1987","unstructured":"Colbourn, C.J.: The Combinatorics of Network Reliability. Oxford University Press, NewYork, Oxford (1987)"},{"key":"1437_CR7","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1016\/0020-0190(88)90025-7","volume":"27","author":"A Esfahanian","year":"1988","unstructured":"Esfahanian, A., Hakimi, S.: On computing a conditional edge connectivity of a graph. Inform. Process. Lett. 27, 195\u2013199 (1988)","journal-title":"Inform. Process. Lett."},{"key":"1437_CR8","doi-asserted-by":"crossref","first-page":"437","DOI":"10.1007\/BF01234384","volume":"37","author":"CD Godsil","year":"1981","unstructured":"Godsil, C.D.: Connectivity of minimal Cayley graphs. Arch. Math. 37, 437\u2013476 (1981)","journal-title":"Arch. Math."},{"key":"1437_CR9","doi-asserted-by":"crossref","first-page":"78","DOI":"10.1002\/net.20224","volume":"52","author":"M L\u00fc","year":"2008","unstructured":"L\u00fc, M., Wu, C., Chen, G.L., L\u00fc, C.: On super connectivity of Cartesian product graphs. Networks 52, 78\u201387 (2008)","journal-title":"Networks"},{"key":"1437_CR10","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1007\/BF01220924","volume":"21","author":"M Mader","year":"1970","unstructured":"Mader, M.: \u00dcber den zusammen symmetricher graphen. Arch. Math. 21, 331\u2013336 (1970)","journal-title":"Arch. Math."},{"key":"1437_CR11","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1007\/BF01433466","volume":"191","author":"M Mader","year":"1971","unstructured":"Mader, M.: Minimal $$n$$ n -fach Kantenzusammenhangenden Granphen. Math. Ann. 191, 21\u201328 (1971)","journal-title":"Math. Ann."},{"key":"1437_CR12","doi-asserted-by":"crossref","first-page":"777","DOI":"10.1137\/0212053","volume":"12","author":"JS Provan","year":"1983","unstructured":"Provan, J.S., Ball, M.O.: The complexity of counting cuts and of computing the probability that a graph is connected. SIAM J. Comput. 12, 777\u2013788 (1983)","journal-title":"SIAM J. Comput."},{"key":"1437_CR13","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1002\/net.10037","volume":"40","author":"BS Shieh","year":"2002","unstructured":"Shieh, B.S.: Super edge-and point-connectivities of the Cartesian product of regular graphs. Networks 40, 91\u201396 (2002)","journal-title":"Networks"},{"key":"1437_CR14","doi-asserted-by":"crossref","first-page":"682","DOI":"10.1016\/j.aml.2007.06.010","volume":"21","author":"S \u0160pacapan","year":"2008","unstructured":"\u0160pacapan, S.: Connectvity of Cartesian products of graphs. Appl. Math. Lett. 21, 682\u2013685 (2008)","journal-title":"Appl. Math. Lett."},{"key":"1437_CR15","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1007\/978-1-4757-2491-2_2","volume-title":"Combinatorial Network Theory","author":"R Tindell","year":"1996","unstructured":"Tindell, R.: Connectivity of Cayley graphs. In: Du, D.Z., Hsu, D.F. (eds.) Combinatorial Network Theory, pp. 41\u201364. Kluwer, Dordrecht (1996)"},{"key":"1437_CR16","volume-title":"Topological Structure and Analysis of Interconnection Networks","author":"JM Xu","year":"2001","unstructured":"Xu, J.M.: Topological Structure and Analysis of Interconnection Networks. Kluwer Academic Publishers, Dordrecht Boston London (2001)"},{"key":"1437_CR17","doi-asserted-by":"crossref","first-page":"1175","DOI":"10.1109\/31.7582","volume":"35","author":"CS Yang","year":"1988","unstructured":"Yang, C.S., Wang, J.F., Lee, J.Y., Boesch, F.T.: Graph theoretic reliable analysis for the Boolean $$n$$ n -cube networks. IEEE Trans. Circuits Syst. 35, 1175\u20131179 (1988)","journal-title":"IEEE Trans. Circuits Syst."}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-014-1437-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-014-1437-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-014-1437-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,10]],"date-time":"2019-08-10T08:37:34Z","timestamp":1565426254000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-014-1437-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,5,15]]},"references-count":17,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2015,9]]}},"alternative-id":["1437"],"URL":"https:\/\/doi.org\/10.1007\/s00373-014-1437-x","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,5,15]]}}}