{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,28]],"date-time":"2025-09-28T16:40:09Z","timestamp":1759077609723,"version":"3.44.0"},"reference-count":15,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/501100004480","name":"Shanxi Province Natural Science Foundation","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100004480","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Applied Mathematics and Computation"],"published-print":{"date-parts":[[2026,1]]},"DOI":"10.1016\/j.amc.2025.129698","type":"journal-article","created":{"date-parts":[[2025,8,30]],"date-time":"2025-08-30T12:52:36Z","timestamp":1756558356000},"page":"129698","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Super edge-connectivity of transitive hypergraphs"],"prefix":"10.1016","volume":"509","author":[{"given":"Shuang","family":"Zhao","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiaomin","family":"Hu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Weihua","family":"Yang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/j.amc.2025.129698_bib0001","doi-asserted-by":"crossref","first-page":"487","DOI":"10.1002\/jgt.3190080406","article-title":"Circulants and their connectivity","volume":"8","author":"Boesch","year":"1984","journal-title":"J. Graph Theory"},{"year":"1993","series-title":"Algebraic Graph Theory","author":"Biggs","key":"10.1016\/j.amc.2025.129698_bib0002"},{"key":"10.1016\/j.amc.2025.129698_bib0003","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1007\/BF02940782","article-title":"Cayley, Marty and Schreier hypergraphs","volume":"64","author":"Buratti","year":"1994","journal-title":"Abh. Math. Sem. Univ. Hamburg"},{"key":"10.1016\/j.amc.2025.129698_bib0004","doi-asserted-by":"crossref","first-page":"252","DOI":"10.1002\/jgt.23035","article-title":"The edge-connectivity of vertex-transitive hypergraphs","volume":"105","author":"Burgess","year":"2024","journal-title":"J. Graph Theory"},{"key":"10.1016\/j.amc.2025.129698_bib0005","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1016\/j.disc.2015.07.008","article-title":"Maximally edge-connected hypergraphs","volume":"339","author":"Dankelmann","year":"2016","journal-title":"Discrete Math."},{"key":"10.1016\/j.amc.2025.129698_bib0006","doi-asserted-by":"crossref","first-page":"252","DOI":"10.4153\/CMB-2018-005-9","article-title":"Connectivity in hypergraphs","volume":"61","author":"Dewar","year":"2018","journal-title":"Can. Math. Bull."},{"key":"10.1016\/j.amc.2025.129698_bib0007","doi-asserted-by":"crossref","first-page":"1394","DOI":"10.1016\/j.disc.2013.03.003","article-title":"Realizing degree sequences with k-edge-connected uniform hypergraphs","volume":"313","author":"Gu","year":"2013","journal-title":"Discrete Math."},{"key":"10.1016\/j.amc.2025.129698_bib0008","unstructured":"J.Y. Guo, J. Wang, Z.Y. Cai, H.Y. Li, New sufficient conditions for an r-uniform hypergraph to be k-edge-connected, arxiv.2212.09014v1."},{"key":"10.1016\/j.amc.2025.129698_bib0009","first-page":"2548","article-title":"Hypergraph learning: methods and practices","volume":"44","author":"Gao","year":"2022","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"10.1016\/j.amc.2025.129698_bib0010","doi-asserted-by":"crossref","first-page":"3181","DOI":"10.1109\/TPAMI.2022.3182052","article-title":"HGNN+: general hypergraph neural networks","volume":"45","author":"Gao","year":"2023","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"10.1016\/j.amc.2025.129698_bib0011","doi-asserted-by":"crossref","first-page":"524","DOI":"10.1137\/0403044","article-title":"Vertex transitivity and super line connectedness","volume":"3","author":"Hamidoune","year":"1990","journal-title":"SIAM J. Discrete Math."},{"key":"10.1016\/j.amc.2025.129698_bib0012","doi-asserted-by":"crossref","first-page":"2356","DOI":"10.1016\/j.disc.2011.08.010","article-title":"Edge-connectivity of permutation hypergraphs","volume":"312","author":"Jami","year":"2012","journal-title":"Discrete Math."},{"key":"10.1016\/j.amc.2025.129698_bib0013","doi-asserted-by":"crossref","first-page":"1003","DOI":"10.1016\/j.ejc.2007.11.010","article-title":"On s-arc transitive hypergraphs","volume":"29","author":"Mansilla","year":"2008","journal-title":"Eur. J. Comb."},{"key":"10.1016\/j.amc.2025.129698_bib0014","doi-asserted-by":"crossref","first-page":"188","DOI":"10.1016\/j.dam.2018.11.004","article-title":"Maximally connected p-partite uniform hypergraphs","volume":"264","author":"Shan","year":"2019","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/j.amc.2025.129698_bib0015","doi-asserted-by":"crossref","first-page":"1065","DOI":"10.1007\/s00373-020-02165-w","article-title":"Degree sequence conditions for hypergraphs to be maximally edge connected and super edge connected","volume":"36","author":"Zhao","year":"2020","journal-title":"Graphs Comb."}],"container-title":["Applied Mathematics and Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0096300325004242?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0096300325004242?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,9,28]],"date-time":"2025-09-28T16:01:19Z","timestamp":1759075279000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0096300325004242"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,1]]},"references-count":15,"alternative-id":["S0096300325004242"],"URL":"https:\/\/doi.org\/10.1016\/j.amc.2025.129698","relation":{},"ISSN":["0096-3003"],"issn-type":[{"type":"print","value":"0096-3003"}],"subject":[],"published":{"date-parts":[[2026,1]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Super edge-connectivity of transitive hypergraphs","name":"articletitle","label":"Article Title"},{"value":"Applied Mathematics and Computation","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.amc.2025.129698","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2025 Elsevier Inc. All rights are reserved, including those for text and data mining, AI training, and similar technologies.","name":"copyright","label":"Copyright"}],"article-number":"129698"}}