Edge-pancyclicity of Cartesian Product Graphs
Jun Jie Yuan · Journal of Taiyuan University of Science and Technology · 2012
The subgraph embedding is an important issue in evaluating an inter-connection network.As an important subgraph,how well the cycles can be embedded in an interconnection network can be measured by the pancyclicityof the interconnection network.The Cartesian product graph is an important class of topological structures of interconnection networks.Let the Cartesian product graph G=Ck1×Ck2.Using the vertex-transitivity and edge-transitivity weshowed that G is edge-bipancyclic if k1≥3 and k2≥3.Moreover,G is(k1+k22)-edge-pancyclic if k1 and k2 are odd,where k1≥3 and k2≥3.