Cartesian积图的边泛圈性

网络中子图的可嵌入性是度量网络优劣的一个重要性能。圈作为网络拓扑中一类重要的子图,其可嵌入性可以通过泛圈性来度量。Cartesian积图是互联网络拓扑结构中一类非常重要的图类。设G是长为k1和k2的圈的Cartesian积图。利用Cartesian积图的顶点和边的传递性,证明了当k1≥3,k2≥3,G是边偶泛圈的;当k1,k2均为奇数时,G是（k1＋k22）-边泛圈的。

Edge-pancyclicity of Cartesian Product Graphs

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.