The 3-good-neighbor connectivity of modified bubble-sort graphs

DOI10.1155/2020/7845987MaRDI QIDQ2214809zbMATH OpenOpenAlexFDO

Authors Yanling Wang, Shiying Wang

Publication date 10 December 2020

Published in Mathematical Problems in Engineering (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1155/2020/7845987

Mathematics Subject Classification ID

Connectivity (05C40)

Review text

Summary: Let \(G=\left( V \left( G\right), E \left( G\right)\right)\) be a connected graph. A subset \(F\subseteq V\left( G\right)\) 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 \(\text{MB}_n\) is a special Cayley graph. It has many good properties. In this paper, we prove that the 3-good-neighbor connectivity of \(\mathrm{MB}_n\) is \(8n-24\) for \(n\geq6\).

Recommendations

• The generalized 3-connectivity of star graphs and bubble-sort graphs
• Restricted vertex connectivity of modified bubble sort graphs
• The connectivity and super connectivity of the bubble-sort graph
• Fault-tolerant strong Menger connectivity of modified bubble-sort graphs
• The generalized connectivity of bubble-sort star graphs
• On the \(g\)-good-neighbor connectivity of graphs
• Conditional connectivity of bubble sort graphs
• The extra connectivity of bubble-sort star graphs
• On strong Menger connectivity of \((n,k)\)-bubble-sort networks
• Edge-fault-tolerant strong Menger edge connectivity of bubble-sort graphs

Cites work

• A group-theoretic model for symmetric interconnection networks
• A kind of conditional connectivity of Cayley graphs generated by unicyclic graphs
• Conditional connectivity of bubble sort graphs
• Conditional connectivity of Cayley graphs generated by transposition trees
• Fault resiliency of Cayley graphs generated by transpositions
• Fault tolerance in bubble-sort graph networks
• Fault-tolerant maximal local-connectivity on bubble-sort star graphs
• Linearly many faults in Cayley graphs generated by transposition trees
• One conjecture of bubble-sort graphs
• Orienting Cayley graphs generated by transposition trees
• Restricted vertex connectivity of modified bubble sort graphs
• Symmetry in interconnection networks based on Cayley graphs of permutation groups: A survey
• The 2-good-neighbor connectivity and 2-good-neighbor diagnosability of bubble-sort star graph networks
• The generalized 3-connectivity of star graphs and bubble-sort graphs

Cited in

(9)

• Reliability assessment for modified bubble-sort networks
• Edge-fault-tolerant strong Menger edge connectivity of bubble-sort graphs
• On the reliability of modified bubble-sort graphs
• Restricted vertex connectivity of modified bubble sort graphs
• The (n,k)-Modified-Bubble-Sort Graph: A Generalized Modified-Bubble-Sort Graph
• Fault-tolerant strong Menger connectivity of modified bubble-sort graphs
• Extra path-structure connectivity of modified bubble-sort networks
• The 1-good-neighbour diagnosability of modified bubblesort graphs under the PMC and MM* models
• Two-disjoint-cycle-cover pancyclicity of split-star networks

This page was built for publication: The 3-good-neighbor connectivity of modified bubble-sort graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2214809)