Ekinci, Gülnaz Boruzanlı2023-01-122023-01-1220212645-8845https://doi.org/10.33401/fujma.975352https://search.trdizin.gov.tr/yayin/detay/506754https://hdl.handle.net/11454/80900Let $ G=(V,E) $ be a graph. The double vertex graph $F_2(G)$ of $ G $ is the graph whose vertex set consists of all $ 2 $-subsets of $ V(G) $ such that two vertices are adjacent in $ F_2(G) $ if their symmetric difference is a pair of adjacent vertices in $ G $. The super--connectivity of a connected graph is the minimum number of vertices whose removal results in a disconnected graph without an isolated vertex. In this paper, we determine the super--connectivity of the double vertex graph of the complete bipartite graph $ K_{m,n} $ for $ mgeq 4 $ where $ ngeq m+2 $.en10.33401/fujma.975352info:eu-repo/semantics/openAccessSuper connectivityDouble vertex graphToken graphConnectivityArticle44251257506754