Bisectional Fault-Tolerant Communication Architecture for Supercomputer Systems
IEEE Transactions on Computers
Sufficient conditions for λ′-optimality of graphs with small conditional diameter
Information Processing Letters
Lower bounds on the vertex-connectivity of digraphs and graphs
Information Processing Letters
An open problem: (4; g)-cages with odd g ≥ 5 are tightly superconnected
CATS '07 Proceedings of the thirteenth Australasian symposium on Theory of computing - Volume 65
On the edge-connectivity and restricted edge-connectivity of a product of graphs
Discrete Applied Mathematics
Superconnectivity of regular graphs with small diameter
Discrete Applied Mathematics
On the number of components of (k,g)-cages after vertex deletion
Discrete Applied Mathematics
Sufficient conditions for λ'-optimality of graphs with small conditional diameter
Information Processing Letters
On the connectivity and superconnected graphs with small diameter
Discrete Applied Mathematics
Superconnectivity of graphs with odd girth g and even girth h
Discrete Applied Mathematics
On average connectivity of the strong product of graphs
Discrete Applied Mathematics
Maximally edge-connected graphs and Zeroth-order general Randić index for 0
Discrete Applied Mathematics
| Hi-index | 0.06 |