{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,28]],"date-time":"2025-09-28T12:48:37Z","timestamp":1759063717618},"reference-count":10,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2010,8,7]],"date-time":"2010-08-07T00:00:00Z","timestamp":1281139200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2011,3]]},"DOI":"10.1007\/s00373-010-0972-3","type":"journal-article","created":{"date-parts":[[2010,8,6]],"date-time":"2010-08-06T09:09:44Z","timestamp":1281085784000},"page":"275-287","source":"Crossref","is-referenced-by-count":2,"title":["Superconnected and Hyperconnected Small Degree Transitive Graphs"],"prefix":"10.1007","volume":"27","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":[[2010,8,7]]},"reference":[{"key":"972_CR1","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":"972_CR2","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-a survey. IEEE Trans. Reliable. 35, 240\u2013246 (1986)","journal-title":"IEEE Trans. Reliable."},{"key":"972_CR3","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":"972_CR4","first-page":"5","volume":"4","author":"C. Liang","year":"2000","unstructured":"Liang C.: The connectivity of vertex-transitive graphs with small regular degrees. J. Xinjing Univ. 4, 5\u20137 (2000)","journal-title":"J. Xinjing Univ."},{"key":"972_CR5","doi-asserted-by":"crossref","first-page":"541","DOI":"10.1006\/eujc.1995.0113","volume":"4","author":"Y.O. Hamidone","year":"1997","unstructured":"Hamidone Y.O.: Subsets with small sums in abelian groups\u2019I: the vosper property. Europ. J. Combin. 4, 541\u2013556 (1997)","journal-title":"Europ. J. Combin."},{"key":"972_CR6","doi-asserted-by":"crossref","first-page":"361","DOI":"10.1016\/0167-8191(93)90054-O","volume":"19","author":"S. Lakshmivaraham","year":"1993","unstructured":"Lakshmivaraham S., Jung-Sing J., Dhall S.K.: Symmetry in interconnection networks on Cayley graphs of permutation groups: a survey. Parallel Comput. 19, 361\u2013407 (1993)","journal-title":"Parallel Comput."},{"key":"972_CR7","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1007\/BF01433466","volume":"191","author":"M. Mader","year":"1971","unstructured":"Mader M.: Minimal n-fach Kantenzusammenhangenden Granphen. Math. Ann. 191, 21\u201328 (1971)","journal-title":"Math. Ann."},{"key":"972_CR8","doi-asserted-by":"crossref","first-page":"601","DOI":"10.1016\/S0166-218X(02)00391-8","volume":"127","author":"M. Jixiang","year":"2003","unstructured":"Jixiang M.: Connevtivity of vertex and edge transitive graphs. Discrete Appl. Math. 127, 601\u2013613 (2003)","journal-title":"Discrete Appl. Math."},{"key":"972_CR9","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)"},{"issue":"4","key":"972_CR10","first-page":"35","volume":"5","author":"W. Dameng","year":"2001","unstructured":"Dameng W., Jixiang M.: Superconnected and hyperconnected cubic transitive graphs. OR Trans. 5(4), 35\u201340 (2001)","journal-title":"OR Trans."}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-010-0972-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-010-0972-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-010-0972-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,28]],"date-time":"2019-05-28T14:58:31Z","timestamp":1559055511000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-010-0972-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,8,7]]},"references-count":10,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2011,3]]}},"alternative-id":["972"],"URL":"https:\/\/doi.org\/10.1007\/s00373-010-0972-3","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,8,7]]}}}