Bipancyclicity in Iterated Line Digraph of Complete Bipartite Digraph
Cai Huipin · Journal of Shihezi University · 2014
The pancyclicity in an topology of a network(graph or digraph) is an important topological property.Simultaneously,it is an key indicator in evaluating an interconnection network.The bipartite digraph LCBD(d,n) is a family of dense bipartite digraphs which defined as the(n-1)-th iterated line digraph of complete bipartite digraph K_(d,d).In this paper,we study the bipancyclicity of LCBD(d,n).We obtain that LCBD(d,n) is bipancyclic,and vertex-n-bipancyclic if n is a even,or vertex-(n+1)-bipancyclic if n is an odd by constructing a 2d~n—digit sequence from a Euler circuit of LCBD(d,n-1).