On computing a conditional edge-connectivity of a graph
Information Processing Letters
Super edge-connectivity of dense digraphs and graphs
Discrete Applied Mathematics - Special double volume: interconnection networks
On the extraconnectivity of graphs
Discrete Mathematics - Special issue on combinatorics
Efficient algorithms for reliability analysis of distributed computing systems
Information Sciences: an International Journal
Improved Lower Bounds on the Reliability of Hypercube Architectures
IEEE Transactions on Parallel and Distributed Systems
Edge-connectivity and super edge-connectivity of P2-path graphs
Discrete Mathematics
Super connectivity of line graphs
Information Processing Letters
On reliability of the folded hypercubes
Information Sciences: an International Journal
Line Digraph Iterations and the (d, k) Digraph Problem
IEEE Transactions on Computers
Substar Reliability Analysis in Star Networks
Information Sciences: an International Journal
Graph Theory
Conditional matching preclusion sets
Information Sciences: an International Journal
Longest fault-free paths in hypercubes with vertex faults
Information Sciences: an International Journal
Edge fault tolerance of super edge connectivity for three families of interconnection networks
Information Sciences: an International Journal
Conditional connectivity of star graph networks under embedding restriction
Information Sciences: an International Journal
Sufficient conditions for triangle-free graphs to be optimally restricted edge-connected
Discrete Applied Mathematics
{2,3}-Extraconnectivities of hypercube-like networks
Journal of Computer and System Sciences
On the connectivity and restricted edge-connectivity of 3-arc graphs
Discrete Applied Mathematics
| Hi-index | 0.07 |
Super restricted connectivity and super restricted edge connectivity are more refined network reliability indices than connectivity and edge connectivity. In this paper, we first introduce the concepts of super restricted connectivity and super restricted edge connectivity and then give a property of graphs with equal p-restricted edge connectivity and 1-p-restricted connectivity. Applying this property, we show a sufficient condition for a line graph to be super p-restricted edge-connected and a relationship between super 1-p-restricted connected graphs and super p-restricted edge-connected graphs.