EN
The Super-Connectivity of the Double Vertex Graph of Complete Bipartite Graphs
Abstract
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 $.
Keywords
References
- [1] Y. Alavi, M. Behzad, P. Erdos, D. R. Lick, Double vertex graphs, J. Comb. Inf. Syst. Sci., 16(1) (1991), 37-50.
- [2] Y. Alavi, M. Behzad, J. E. Simpson, Planarity of Double Vertex Graphs, Graph theory, combinatorics, algorithms, and applications (San Francisco, CA) (1991), 472-485.
- [3] Y. Alavi, D. R. Lick, J. Liu, Survey of double vertex graphs, Graphs Combin., 18(4) (2002), 709-715.
- [4] T. Rudolph, Constructing physically intuitive graph invariants, (2002), arXiv:quant-ph/0206068.
- [5] K. Audenaert, C. Godsil, G. Royle, T. Rudolph, Symmetric squares of graphs, J. Combin. Theory Ser. B, 97(1) (2007), 74-90.
- [6] R. Fabila-Monroy, D. Flores-Pe˜naloza, C. Huemer, F. Hurtado, J. Urrutia, D. R. Wood, Token graphs, Graphs Combin., 28(3) (2012), 365-380.
- [7] L. Adame, L. M. Rivera, A. L. Trujillo-Negrete, Hamiltonicity of the double vertex graph and the complete double vertex graph of some join graphs, (2020), arXiv:2007.00115 [math.CO].
- [8] L. Adame, L. M. Rivera, A. L. Trujillo-Negrete, Hamiltonicity of token graphs of some join graphs, Symmetry, 13(6) (2021), 1076.
Details
Primary Language
English
Subjects
Mathematical Sciences
Journal Section
Research Article
Authors
Publication Date
December 1, 2021
Submission Date
July 28, 2021
Acceptance Date
October 26, 2021
Published in Issue
Year 1970 Volume: 4 Number: 4
APA
Boruzanlı Ekinci, G. (2021). The Super-Connectivity of the Double Vertex Graph of Complete Bipartite Graphs. Fundamental Journal of Mathematics and Applications, 4(4), 251-257. https://doi.org/10.33401/fujma.975352
AMA
1.Boruzanlı Ekinci G. The Super-Connectivity of the Double Vertex Graph of Complete Bipartite Graphs. Fundam. J. Math. Appl. 2021;4(4):251-257. doi:10.33401/fujma.975352
Chicago
Boruzanlı Ekinci, Gülnaz. 2021. “The Super-Connectivity of the Double Vertex Graph of Complete Bipartite Graphs”. Fundamental Journal of Mathematics and Applications 4 (4): 251-57. https://doi.org/10.33401/fujma.975352.
EndNote
Boruzanlı Ekinci G (December 1, 2021) The Super-Connectivity of the Double Vertex Graph of Complete Bipartite Graphs. Fundamental Journal of Mathematics and Applications 4 4 251–257.
IEEE
[1]G. Boruzanlı Ekinci, “The Super-Connectivity of the Double Vertex Graph of Complete Bipartite Graphs”, Fundam. J. Math. Appl., vol. 4, no. 4, pp. 251–257, Dec. 2021, doi: 10.33401/fujma.975352.
ISNAD
Boruzanlı Ekinci, Gülnaz. “The Super-Connectivity of the Double Vertex Graph of Complete Bipartite Graphs”. Fundamental Journal of Mathematics and Applications 4/4 (December 1, 2021): 251-257. https://doi.org/10.33401/fujma.975352.
JAMA
1.Boruzanlı Ekinci G. The Super-Connectivity of the Double Vertex Graph of Complete Bipartite Graphs. Fundam. J. Math. Appl. 2021;4:251–257.
MLA
Boruzanlı Ekinci, Gülnaz. “The Super-Connectivity of the Double Vertex Graph of Complete Bipartite Graphs”. Fundamental Journal of Mathematics and Applications, vol. 4, no. 4, Dec. 2021, pp. 251-7, doi:10.33401/fujma.975352.
Vancouver
1.Gülnaz Boruzanlı Ekinci. The Super-Connectivity of the Double Vertex Graph of Complete Bipartite Graphs. Fundam. J. Math. Appl. 2021 Dec. 1;4(4):251-7. doi:10.33401/fujma.975352
