@article{article_975352, title={The Super-Connectivity of the Double Vertex Graph of Complete Bipartite Graphs}, journal={Fundamental Journal of Mathematics and Applications}, volume={4}, pages={251–257}, year={2021}, DOI={10.33401/fujma.975352}, author={Boruzanlı Ekinci, Gülnaz}, keywords={Connectivity, Double vertex graph, Super connectivity, Token graph}, abstract={<div style="text-align:justify;">Let $ 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 $ m\geq 4 $ where $ n\geq m+2 $. </div>}, number={4}, publisher={Fuat USTA}