On an Optimally Fault-Tolerant Multiprocessor Network Architecture
IEEE Transactions on Computers
Isomorphic factorization, the Kronecker product and the line digraph
Information Processing Letters
On the edge-connectivity and restricted edge-connectivity of a product of graphs
Discrete Applied Mathematics
Calculating the extremal number ex(v;{C3,C4,...,Cn})
Discrete Applied Mathematics
The twin domination number in generalized de Bruijn digraphs
Information Processing Letters
On the connectivity and superconnected graphs with small diameter
Discrete Applied Mathematics
On the k-tuple domination of generalized de Brujin and Kautz digraphs
Information Sciences: an International Journal
Superconnectivity of graphs with odd girth g and even girth h
Discrete Applied Mathematics
The k-tuple twin domination in generalized de Bruijn and Kautz networks
Computers & Mathematics with Applications
Radial Moore graphs of radius three
Discrete Applied Mathematics
| Hi-index | 14.99 |
This paper clarifies the relation between the diameter k and the edge or node connectivity Ce or c,, of digraphs. The following two inequalities are derived: where n is the number of nodes, d is the maximum degree, and d is the minimum degree.