On M-Polynomials and Covering of Cube Connected Cycles

Abstract

Cube connected networks are designed from the hypercube architecture which has attractive properties. Edges in the cube-connected networks depict the node-to-node communication amidst processors. M-Polynomials have got new dimensions from different architectures that proved themselves result oriented in the indices related to topology. This article focuses on the derivation of M-Polynomials and vertex and edge covering for the cube connected cycles of dimension n. The nodes in the covering set assists in keeping all the communication links secure in the network.