Using a progressive withdrawal procedure to study superconnectivity in digraphs
Discrete Mathematics - Special issue: Combinatorics 2000
Lower bounds on the vertex-connectivity of digraphs and graphs
Information Processing Letters
Maximally edge-connected graphs and Zeroth-order general Randić index for 0
Discrete Applied Mathematics
Hi-index | 0.00 |