Edge-cuts leaving components of order at least three
Discrete Mathematics
Super connectivity of line graphs
Information Processing Letters
On optimally-λ(3) transitive graphs
Discrete Applied Mathematics
On reliability of the folded hypercubes
Information Sciences: an International Journal
Fault-tolerant analysis of a class of networks
Information Processing Letters
Restricted arc-connectivity of digraphs
Information Processing Letters
The super connectivity of augmented cubes
Information Processing Letters
Information Processing Letters
Diameter-sufficient conditions for a graph to be super-restricted connected
Discrete Applied Mathematics
Super-connected arc-transitive digraphs
Discrete Applied Mathematics
Minimally 3-restricted edge connected graphs
Discrete Applied Mathematics
On the 3-restricted edge connectivity of permutation graphs
Discrete Applied Mathematics
The restricted arc connectivity of Cartesian product digraphs
Information Processing Letters
On optimally-λ(3) transitive graphs
Discrete Applied Mathematics
Super connectivity of line graphs
Information Processing Letters
Super-connected but not super edge-connected graphs
Information Processing Letters
Restricted edge connectivity of harary graphs
COCOA'11 Proceedings of the 5th international conference on Combinatorial optimization and applications
Edge fault tolerance of graphs with respect to super edge connectivity
Discrete Applied Mathematics
Super restricted edge connectivity of regular edge-transitive graphs
Discrete Applied Mathematics
Sufficient conditions for triangle-free graphs to be optimally restricted edge-connected
Discrete Applied Mathematics
λ'-Optimality of Bipartite Digraphs
Information Processing Letters
Optimally restricted edge connected elementary Harary graphs
Theoretical Computer Science
Vulnerability of super edge-connected networks
Theoretical Computer Science
The minimum restricted edge-connected graph and the minimum size of graphs with a given edge-degree
Discrete Applied Mathematics
| Hi-index | 0.06 |