Two-disjoint-cycle-cover bipancyclicity of balanced hypercubes

Appl. Math. Comput., pp. 1253052020.

Cited by: 0|Bibtex|Views2|Links
EI

Abstract:

Abstract A bipartite graph G is two-disjoint-cycle-cover [r1, r2]-bipancyclic if for any even integer l satisfying r1 ≤ l ≤ r2, there exist two vertex-disjoint cycles C1 and C2 in G such that | V ( C 1 ) | = l and | V ( C 2 ) | = | V ( G ) | − l , where |V(G)| denotes the number of v...More

Code:

Data:

Your rating :
0

 

Tags
Comments