{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,30]],"date-time":"2025-07-30T15:37:54Z","timestamp":1753889874833,"version":"3.41.2"},"reference-count":0,"publisher":"Centre pour la Communication Scientifique Directe (CCSD)","issue":"Graph Theory","license":[{"start":{"date-parts":[[2020,4,14]],"date-time":"2020-04-14T00:00:00Z","timestamp":1586822400000},"content-version":"am","delay-in-days":0,"URL":"https:\/\/arxiv.org\/licenses\/nonexclusive-distrib\/1.0"},{"start":{"date-parts":[[2020,4,14]],"date-time":"2020-04-14T00:00:00Z","timestamp":1586822400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/arxiv.org\/licenses\/nonexclusive-distrib\/1.0"},{"start":{"date-parts":[[2020,4,14]],"date-time":"2020-04-14T00:00:00Z","timestamp":1586822400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/arxiv.org\/licenses\/nonexclusive-distrib\/1.0"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"accepted":{"date-parts":[[2025,4,1]]},"abstract":"<jats:p>For positive integers $n,k$ and $t$, the uniform subset graph $G(n, k, t)$ has all $k$-subsets of $\\{1,2,\\ldots, n\\}$ as vertices and two $k$-subsets are joined by an edge if they intersect at exactly $t$ elements. The Johnson graph $J(n,k)$ corresponds to $G(n,k,k-1)$, that is, two vertices of $J(n,k)$ are adjacent if the intersection of the corresponding $k$-subsets has size $k-1$. A super vertex-cut of a connected graph is a set of vertices whose removal disconnects the graph without isolating a vertex and the super-connectivity is the size of a minimum super vertex-cut. In this work, we fully determine the super-connectivity of the family of Johnson graphs $J(n,k)$ for $n\\geq k\\geq 1$.<\/jats:p>","DOI":"10.23638\/dmtcs-22-1-12","type":"journal-article","created":{"date-parts":[[2025,4,3]],"date-time":"2025-04-03T16:57:44Z","timestamp":1743699464000},"source":"Crossref","is-referenced-by-count":0,"title":["The super-connectivity of Johnson graphs"],"prefix":"10.23638","volume":"vol. 22 no. 1","author":[{"given":"G\u00fclnaz Boruzanl\u0131","family":"Ekinci","sequence":"first","affiliation":[]},{"given":"John Baptist","family":"Gauci","sequence":"additional","affiliation":[]}],"member":"25203","published-online":{"date-parts":[[2020,4,14]]},"container-title":["Discrete Mathematics &amp; Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/arxiv.org\/pdf\/1906.06488v4","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/arxiv.org\/pdf\/1906.06488v4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,3]],"date-time":"2025-04-03T16:57:44Z","timestamp":1743699464000},"score":1,"resource":{"primary":{"URL":"http:\/\/dmtcs.episciences.org\/5600"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,4,14]]},"references-count":0,"journal-issue":{"issue":"Graph Theory","published-online":{"date-parts":[[2020,4,14]]}},"URL":"https:\/\/doi.org\/10.23638\/dmtcs-22-1-12","relation":{"has-preprint":[{"id-type":"arxiv","id":"1906.06488v3","asserted-by":"subject"},{"id-type":"arxiv","id":"1906.06488v2","asserted-by":"subject"}],"is-same-as":[{"id-type":"arxiv","id":"1906.06488","asserted-by":"subject"},{"id-type":"doi","id":"10.48550\/arXiv.1906.06488","asserted-by":"subject"}]},"ISSN":["1365-8050"],"issn-type":[{"type":"electronic","value":"1365-8050"}],"subject":[],"published":{"date-parts":[[2020,4,14]]},"article-number":"5600"}}