Pancyclicity of recursive circulant graphs
Information Processing Letters
Edge-pancyclicity of recursive circulants
Information Processing Letters
Discrete Applied Mathematics - Special issue on international workshop on algorithms, combinatorics, and optimization in interconnection networks (IWACOIN '99)
Hamiltonian properties on the class of hypercube-like networks
Information Processing Letters - Devoted to the rapid publication of short contributions to information processing
The super-connected property of recursive circulant graphs
Information Processing Letters
Fault-Hamiltonicity of Hypercube-Like Interconnection Networks
IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Papers - Volume 01
Maximum induced subgraph of a recursive circulant
Information Processing Letters
Many-to-Many Disjoint Path Covers in Hypercube-Like Interconnection Networks with Faulty Elements
IEEE Transactions on Parallel and Distributed Systems
Panconnectivity and pancyclicity of hypercube-like interconnection networks with faulty elements
Theoretical Computer Science
Panconnectivity and edge-pancyclicity of faulty recursive circulant G(2m,4)
Theoretical Computer Science
On the independent spanning trees of recursive circulant graphs G(cdm,d) with d2
Theoretical Computer Science
Maximum induced subgraph of a recursive circulant
Information Processing Letters
Fault-hamiltonicity of product graph of path and cycle
COCOON'03 Proceedings of the 9th annual international conference on Computing and combinatorics
Pancyclicity of Restricted Hypercube-Like Networks under the Conditional Fault Model
SIAM Journal on Discrete Mathematics
Disjoint path covers in recursive circulants G(2m,4) with faulty elements
Theoretical Computer Science
Theoretical Computer Science
The (strong) rainbow connection numbers of Cayley graphs on Abelian groups
Computers & Mathematics with Applications
A fast fault-identification algorithm for bijective connection graphs using the PMC model
Information Sciences: an International Journal
Many-to-Many disjoint path covers in a graph with faulty elements
ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation
{2,3}-Extraconnectivities of hypercube-like networks
Journal of Computer and System Sciences
Edge-fault tolerance of hypercube-like networks
Information Processing Letters
| Hi-index | 5.23 |