Premium
Neighborhood conditions for graphs to be super restricted edge connected
Author(s) -
Wang Shiying,
Li Jing,
Wu Lihong,
Lin Shangwei
Publication year - 2010
Publication title -
networks
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.977
H-Index - 64
eISSN - 1097-0037
pISSN - 0028-3045
DOI - 10.1002/net.20343
Subject(s) - combinatorics , enhanced data rates for gsm evolution , mathematics , connectivity , connected component , graph , discrete mathematics , computer science , artificial intelligence
Abstract Restricted edge connectivity is a more refined network reliability index than edge connectivity. For a connected graph G = ( V , E ), an edge set S ⊆ E is a restricted edge cut if G − S is disconnected and every component of G − S has at least two vertices. The restricted edge connectivity of G is defined as the cardinality of a minimum restricted edge cut. G is super restricted edge connected if every minimum restricted edge cut of G isolates one edge. In this article, we present several neighborhood conditions for a graph to be super restricted edge connected. © 2009 Wiley Periodicals, Inc. NETWORKS, 2010