Paper Info
Title
Strongly Menger-edge-connectedness and strongly Menger-vertex-connectedness of regular networks.
Abstract
Let F be a conditional faulty edge set of a graph G. Here the condition imposed on F is δ(G−F)≥r for some fixed integer r. The graph G is called F-strongly Menger-edge-connected of order r if each pair of distinct vertices u and v are connected by min{degG−F(u), degG−F(v)} edge-disjoint paths in G−F, where degG−F(u) and degG−F(v) are the degrees of u and v in G−F, respectively. A graph G is t-strongly Menger-edge-connected of order r if G is F-strongly Menger-edge-connected of order r for every F⊂E(G) with |F|≤t. One can consider the vertex version in an analogous way.
Year
DOI
Venue
2018
10.1016/j.tcs.2018.04.001
Theoretical Computer Science
Keywords
Field
DocType
Strongly Menger edge connectivity of order r,Strongly Menger vertex connectivity of order r,Conditional faulty set,Interconnection networks
Integer,Graph,Discrete mathematics,Social connectedness,Combinatorics,Vertex (geometry),Regular graph,Mathematics
Journal
Volume
Issue
ISSN
731
C
0304-3975
Citations 
PageRank 
References 
2
0.37
22
Authors
3
Name
Order
Citations
PageRank
Shengjie He132.08
Rongxia Hao216526.11
Eddie Cheng329133.47