Abstract:A connected graph G is called strongly Menger edge connected if G has min{deg G (x), deg G (y)} edge-disjoint paths between any two distinct vertices x and y in G. In this paper, we consider two types of strongly Menger edge connectivity of the line graphs of n-dimensional hypercube-like networks with faulty edges, namely the m-edgefault-tolerant and m-conditional edge-fault-tolerant strongly Menger edge connectivity. We show that the line graph of any n-dimensional hypercube-like network is (2n − 4)edge-fault… Show more
Set email alert for when this publication receives citations?
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.