Strong Menger connectedness of augmented k-ary n-cubes

10/02/2019
by   Mei-Mei Gu, et al.
0

A connected graph G is called strongly Menger (edge) connected if for any two distinct vertices x,y of G, there are min{ deg_G(x), deg_G(y)} vertex(edge)-disjoint paths between x and y. In this paper, we consider strong Menger (edge) connectedness of the augmented k-ary n-cube AQ_n,k, which is a variant of k-ary n-cube Q_n^k. By exploring the topological proprieties of AQ_n,k, we show that AQ_n,3 for n≥ 4 (resp. AQ_n,k for n≥ 2 and k≥ 4) is still strongly Menger connected even when there are 4n-9 (resp. 4n-8) faulty vertices and AQ_n,k is still strongly Menger edge connected even when there are 4n-4 faulty edges for n≥ 2 and k≥ 3. Moreover, under the restricted condition that each vertex has at least two fault-free edges, we show that AQ_n,k is still strongly Menger edge connected even when there are 8n-10 faulty edges for n≥ 2 and k≥ 3. These results are all optimal in the sense of the maximum number of tolerated vertex (resp. edge) faults.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
12/31/2019

2-edge-twinless blocks

Let G=(V,E)) be a directed graph. A 2-edge-twinless block in G is a maxi...
research
03/03/2016

Network Unfolding Map by Edge Dynamics Modeling

The emergence of collective dynamics in neural networks is a mechanism o...
research
01/25/2021

Constant Amortized Time Enumeration of Eulerian trails

In this paper, we consider enumeration problems for edge-distinct and ve...
research
09/05/2023

Computing Hive Plots: A Combinatorial Framework

Hive plots are a graph visualization style placing vertices on a set of ...
research
11/15/2012

Statistical inference on errorfully observed graphs

Statistical inference on graphs is a burgeoning field in the applied and...
research
07/24/2019

Constant Delay Traversal of Grammar-Compressed Graphs with Bounded Rank

We present a pointer-based data structure for constant time traversal of...
research
10/19/2018

On the complexity of color-avoiding site and bond percolation

The mathematical analysis of robustness and error-tolerance of complex n...

Please sign up or login with your details

Forgot password? Click here to reset