The Super-Connectivity of the Double Vertex Graph of Complete Bipartite Graphs

Basit Öğe Kaydı
dc.contributor.authorEkinci, Gülnaz Boruzanlı
dc.date.accessioned2023-01-12T20:31:50Z
dc.date.available2023-01-12T20:31:50Z
dc.date.issued2021
dc.departmentN/A/Departmenten_US
dc.description.abstractLet $ 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 $.en_US
dc.identifier.doi10.33401/fujma.975352
dc.identifier.endpage257en_US
dc.identifier.issn2645-8845
dc.identifier.issue4en_US
dc.identifier.startpage251en_US
dc.identifier.trdizinid506754en_US
dc.identifier.urihttps://doi.org/10.33401/fujma.975352
dc.identifier.urihttps://search.trdizin.gov.tr/yayin/detay/506754
dc.identifier.urihttps://hdl.handle.net/11454/80900
dc.identifier.volume4en_US
dc.indekslendigikaynakTR-Dizinen_US
dc.language.isoenen_US
dc.relation.ispartofFundamental journal of mathematics and applications (Online)en_US
dc.relation.publicationcategoryMakale - Ulusal Hakemli Dergi - Kurum Öğretim Elemanıen_US
dc.rightsinfo:eu-repo/semantics/openAccessen_US
dc.subjectSuper connectivityen_US
dc.subjectDouble vertex graphen_US
dc.subjectToken graphen_US
dc.subjectConnectivityen_US
dc.titleThe Super-Connectivity of the Double Vertex Graph of Complete Bipartite Graphsen_US
dc.typeArticleen_US

Dosyalar

Koleksiyon

TR-Dizin İndeksli Yayınlar Koleksiyonu