The 3-Good-Neighbor Connectivity of Modified Bubble-Sort Graphs

Yanling Wang and Shiying Wang

Mathematical Problems in Engineering, 2020, vol. 2020, 1-18

Abstract:

Let be a connected graph. A subset is called a - good-neighbor cut if is disconnected and each vertex of has at least neighbors. The - good-neighbor connectivity of is the minimum cardinality of - good-neighbor cuts. The - dimensional modified bubble-sort graph is a special Cayley graph. It has many good properties. In this paper, we prove that the 3-good-neighbor connectivity of is for .

Date: 2020
References: Add references at CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://downloads.hindawi.com/journals/MPE/2020/7845987.pdf (application/pdf)
http://downloads.hindawi.com/journals/MPE/2020/7845987.xml (text/xml)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hin:jnlmpe:7845987

DOI: 10.1155/2020/7845987

Access Statistics for this article

More articles in Mathematical Problems in Engineering from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().