The Super-Connectivity of the Double Vertex Graph of Complete Bipartite Graphs
Küçük Resim Yok
Tarih
2021
Yazarlar
Dergi Başlığı
Dergi ISSN
Cilt Başlığı
Yayıncı
Erişim Hakkı
info:eu-repo/semantics/openAccess
Özet
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 $ mgeq 4 $ where $ ngeq m+2 $.
Açıklama
Anahtar Kelimeler
Super connectivity, Double vertex graph, Token graph, Connectivity
Kaynak
Fundamental journal of mathematics and applications (Online)
WoS Q Değeri
Scopus Q Değeri
Cilt
4
Sayı
4
