The 3-Good-Neighbor Connectivity of Modified Bubble-Sort Graphs
Joint Authors
Source
Mathematical Problems in Engineering
Issue
Vol. 2020, Issue 2020 (31 Dec. 2020), pp.1-18, 18 p.
Publisher
Hindawi Publishing Corporation
Publication Date
2020-10-28
Country of Publication
Egypt
No. of Pages
18
Main Subjects
Abstract EN
Let G=VG,EG be a connected graph.
A subset F⊆VG is called a g-good-neighbor cut if G−F is disconnected and each vertex of G−F has at least g neighbors.
The g-good-neighbor connectivity of G is the minimum cardinality of g-good-neighbor cuts.
The n-dimensional modified bubble-sort graph MBn is a special Cayley graph.
It has many good properties.
In this paper, we prove that the 3-good-neighbor connectivity of MBn is 8n−24 for n≥6.
American Psychological Association (APA)
Wang, Yanling& Wang, Shiying. 2020. The 3-Good-Neighbor Connectivity of Modified Bubble-Sort Graphs. Mathematical Problems in Engineering،Vol. 2020, no. 2020, pp.1-18.
https://search.emarefa.net/detail/BIM-1200714
Modern Language Association (MLA)
Wang, Yanling& Wang, Shiying. The 3-Good-Neighbor Connectivity of Modified Bubble-Sort Graphs. Mathematical Problems in Engineering No. 2020 (2020), pp.1-18.
https://search.emarefa.net/detail/BIM-1200714
American Medical Association (AMA)
Wang, Yanling& Wang, Shiying. The 3-Good-Neighbor Connectivity of Modified Bubble-Sort Graphs. Mathematical Problems in Engineering. 2020. Vol. 2020, no. 2020, pp.1-18.
https://search.emarefa.net/detail/BIM-1200714
Data Type
Journal Articles
Language
English
Notes
Includes bibliographical references
Record ID
BIM-1200714