{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,28]],"date-time":"2025-09-28T12:47:40Z","timestamp":1759063660669},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2011,10,29]],"date-time":"2011-10-29T00:00:00Z","timestamp":1319846400000},"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":[[2013,3]]},"DOI":"10.1007\/s00373-011-1104-4","type":"journal-article","created":{"date-parts":[[2011,10,28]],"date-time":"2011-10-28T08:40:02Z","timestamp":1319791202000},"page":"241-251","source":"Crossref","is-referenced-by-count":2,"title":["On Vosperian and Superconnected Vertex-Transitive Digraphs"],"prefix":"10.1007","volume":"29","author":[{"given":"Y. O.","family":"Hamidoune","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"A.","family":"Llad\u00f3","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S. C.","family":"L\u00f3pez","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2011,10,29]]},"reference":[{"key":"1104_CR1","first-page":"3","volume":"61","author":"C. Balbuena","year":"2001","unstructured":"Balbuena C., Carmona A.: On the connectivity and superconnectivity of bipartite digraphs and graphs. Ars Combin. 61, 3\u201321 (2001)","journal-title":"Ars Combin."},{"key":"1104_CR2","doi-asserted-by":"crossref","first-page":"240","DOI":"10.1109\/TR.1986.4335424","volume":"35","author":"F.T. Boesch","year":"1986","unstructured":"Boesch F.T.: Synthesis of reliable networks. Surv. IEEE Trans. Reliab. 35, 240\u2013246 (1986)","journal-title":"Surv. IEEE Trans. Reliab."},{"issue":"4","key":"1104_CR3","doi-asserted-by":"crossref","first-page":"487","DOI":"10.1002\/jgt.3190080406","volume":"8","author":"F.T. Boesch","year":"1984","unstructured":"Boesch F.T., Tindell R.: Circulants and their connectivities. J. Graph Theory 8(4), 487\u2013499 (1984)","journal-title":"J. Graph Theory"},{"key":"1104_CR4","first-page":"300","volume-title":"Handbook of graph theory","author":"J. F\u00e0brega","year":"2004","unstructured":"F\u00e0brega J., Fiol M.A.: Futher topics in connectivity. In: Gross, J.L., Yellen, Y. (eds) Handbook of graph theory, pp. 300\u2013329. CRC Press, Boca Raton (2004)"},{"key":"1104_CR5","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1016\/0012-365X(92)00051-R","volume":"124","author":"M.A. Fiol","year":"1994","unstructured":"Fiol M.A.: The superconnectivity of large digraphs and graphs. Discret. Math. 124, 67\u201378 (1994)","journal-title":"Discret. Math."},{"key":"1104_CR6","first-page":"1253","volume":"284","author":"Y.O. Hamidoune","year":"1977","unstructured":"Hamidoune Y.O.: Sur les atomes d\u2019un graphe orient\u00e9. C.R. Acad. Sci. Paris A 284, 1253\u20131256 (1977)","journal-title":"C.R. Acad. Sci. Paris A"},{"key":"1104_CR7","doi-asserted-by":"crossref","first-page":"622","DOI":"10.1006\/jabr.1996.0028","volume":"179","author":"Y.O. Hamidoune","year":"1996","unstructured":"Hamidoune Y.O.: An isoperimetric method in additive theory. J. Algebra 179, 622\u2013630 (1996)","journal-title":"J. Algebra"},{"key":"1104_CR8","doi-asserted-by":"crossref","first-page":"541","DOI":"10.1006\/eujc.1995.0113","volume":"18","author":"Y.O. Hamidoune","year":"1997","unstructured":"Hamidoune Y.O.: Subsets with small sums in Abelian groups I: The Vosper property. Eur. J. Combin. 18, 541\u2013556 (1997)","journal-title":"Eur. J. Combin."},{"key":"1104_CR9","unstructured":"Hamidoune, Y.O.: On small subset product in a group. Structure theory of set-addition. Ast\u00e9risque 258 xiv\u2013xv, 281\u2013308(1999)"},{"key":"1104_CR10","doi-asserted-by":"crossref","first-page":"2007","DOI":"10.5802\/aif.2404","volume":"58","author":"Y.O. Hamidoune","year":"2008","unstructured":"Hamidoune Y.O.: Some additive applications of the isoperimetric approach. Ann. Inst. Fourier Grenoble 58, 2007\u20132036 (2008)","journal-title":"Ann. Inst. Fourier Grenoble"},{"issue":"2","key":"1104_CR11","doi-asserted-by":"crossref","first-page":"124","DOI":"10.1002\/jgt.20521","volume":"67","author":"Y.O. Hamidoune","year":"2011","unstructured":"Hamidoune Y.O., Llad\u00f3 A., L\u00f3pez S.C.: Vertex-transitive graphs that remain connected after failure of a vertex and its neighbors. J. Graph Theory 67(2), 124\u2013138 (2011)","journal-title":"J. Graph Theory"},{"key":"1104_CR12","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1007\/BF01788139","volume":"7","author":"Y.O. Hamidoune","year":"1991","unstructured":"Hamidoune Y.O., Llad\u00f3 A., Serra O.: Vosperian and superconnected Abelian Cayley digraphs. Graphs Combin. 7, 143\u2013152 (1991)","journal-title":"Graphs Combin."},{"key":"1104_CR13","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1007\/s00373-007-0725-0","volume":"23","author":"X. Liang","year":"2007","unstructured":"Liang X., Meng J., Zhang Z.: Super-connectivity and hyperconnectivity of vertex transitive bipartite graphs. Graphs Combin. 23, 309\u2013314 (2007)","journal-title":"Graphs Combin."},{"key":"1104_CR14","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1007\/BF01220924","volume":"21","author":"W. Mader","year":"1970","unstructured":"Mader W.: \u00dcber den Zusammenhang symmetricher Graphen. Arch. Math. 21, 331\u2013336 (1970)","journal-title":"Arch. Math."},{"key":"1104_CR15","unstructured":"Mann H.B.: Addition theorems. R.E. Krieger, New York (1976)"},{"key":"1104_CR16","doi-asserted-by":"crossref","first-page":"601","DOI":"10.1016\/S0166-218X(02)00391-8","volume":"127","author":"J. Meng","year":"2003","unstructured":"Meng J.: Connectivity of vertex and edge transitive graphs. Discret. Appl. Math. 127, 601\u2013613 (2003)","journal-title":"Discret. Appl. Math."},{"key":"1104_CR17","doi-asserted-by":"crossref","first-page":"653","DOI":"10.1016\/j.dam.2008.08.018","volume":"157","author":"J. Meng","year":"2009","unstructured":"Meng J., Zhang Z.: Super-connected arc-transitive digraphs. Discret. Appl. Math. 157, 653\u2013658 (2009)","journal-title":"Discret. Appl. Math."},{"key":"1104_CR18","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1016\/S0021-9800(70)80005-9","volume":"8","author":"M. Watkins","year":"1970","unstructured":"Watkins M.: Connectivity of transitive graphs. J. Combin. Theory 8, 23\u201329 (1970)","journal-title":"J. Combin. Theory"}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-011-1104-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-011-1104-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-011-1104-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,28]],"date-time":"2019-05-28T14:59:32Z","timestamp":1559055572000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-011-1104-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,10,29]]},"references-count":18,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2013,3]]}},"alternative-id":["1104"],"URL":"https:\/\/doi.org\/10.1007\/s00373-011-1104-4","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,10,29]]}}}