System design of the J-Machine
AUSCRYPT '90 Proceedings of the sixth MIT conference on Advanced research in VLSI
Fault-Tolerant Embeddings of Hamiltonian Circuits in k-ary n-Cubes
SIAM Journal on Discrete Mathematics
Lee Distance and Topological Properties of k-ary n-cubes
IEEE Transactions on Computers
On k-ary n-cubes: theory and applications
Discrete Applied Mathematics - Special issue: Algorithmic aspects of communication
Graph Theory
Conditional matching preclusion sets
Information Sciences: an International Journal
Conditional matching preclusion for hypercube-like interconnection networks
Theoretical Computer Science
Path embeddings in faulty 3-ary n-cubes
Information Sciences: an International Journal
Edge disjoint Hamiltonian cycles in k-ary n-cubes and hypercubes
IEEE Transactions on Computers
Conditional matching preclusion for the arrangement graphs
Theoretical Computer Science
Discrete Applied Mathematics
Matching preclusion and conditional matching preclusion for regular interconnection networks
Discrete Applied Mathematics
Matching preclusion for balanced hypercubes
Theoretical Computer Science
Linearly many faults in dual-cube-like networks
Theoretical Computer Science
Strong matching preclusion under the conditional fault model
Discrete Applied Mathematics
The (conditional) matching preclusion for burnt pancake graphs
Discrete Applied Mathematics
Strong matching preclusion for k-ary n-cubes
Discrete Applied Mathematics
Strong matching preclusion for torus networks
Theoretical Computer Science
| Hi-index | 0.05 |
The (conditional) matching preclusion number of a graph is the minimum number of edges whose deletion leaves a resulting graph (with no isolated vertices) that has neither perfect matchings nor almost perfect matchings. In this paper, we prove that the matching preclusion number and the conditional matching preclusion number of the k-ary n-cube with even k=4 are 2n and 4n-2, respectively.