Constructing vertex-disjoint paths in (n, k)-star graphs
Information Sciences: an International Journal
Weak-vertex-pancyclicity of (n, k)-star graphs
Theoretical Computer Science
Conditional fault Hamiltonicity of the complete graph
Information Processing Letters
Neighbourhood Broadcasting and Broadcasting on the (n, k)-Star Graph
ICA3PP '08 Proceedings of the 8th international conference on Algorithms and Architectures for Parallel Processing
On the Surface Area of the (n, k)-Star Graph
COCOA 2008 Proceedings of the 2nd international conference on Combinatorial Optimization and Applications
On the surface area of the (n,k)-star graph
Theoretical Computer Science
One-to-many node-disjoint paths in (n,k)-star graphs
Discrete Applied Mathematics
Distance formula and shortest paths for the (n,k)-star graphs
Information Sciences: an International Journal
Optimum broadcasting algorithms in (n, k)-star graphs using spanning trees
NPC'07 Proceedings of the 2007 IFIP international conference on Network and parallel computing
A kind of conditional fault tolerance of (n,k)-star graphs
Information Processing Letters
The number of shortest paths in the (n, k)-star graphs
COCOA'10 Proceedings of the 4th international conference on Combinatorial optimization and applications - Volume Part I
On the bounds of feedback numbers of (n,k)-star graphs
Information Processing Letters
Hamiltonian connectivity of 2-tree-generated networks
Mathematical and Computer Modelling: An International Journal
On deriving conditional diagnosability of interconnection networks
Information Processing Letters
(n-3)-edge-fault-tolerant weak-pancyclicity of (n,k)-star graphs
Theoretical Computer Science
| Hi-index | 0.90 |