摘要Let G = ( V, E ) be a simple connected graph of order p, and n be a positive integer. The nth power G^n of G is defined as: V(G)= V(G^n), E(G^n)={uv: u, v ∈ V(G), d_G(u, v)≤n},where d_G,(u, v )is the distance between u and v in G.
1DU Beiliang & WANG Jian Department of Mathematics, Suzhou University, Suzhou 215006, China,Nantong Vocational College, Nantong 226007, China.P_(4k-1)-factorization of complete bipartite graphs[J].Science China Mathematics,2005,48(4):539-547. 被引量：2
2WANG Jian & DU Beiliang Nantong Vocational College, Nantong 226007, China,Department of Mathematics, Suzhou University, Suzhou 215006, China.P_(4k-1)-factorization of bipartite multigraphs[J].Science China Mathematics,2006,49(7):961-970. 被引量：1
10ZHOU Junling, CHANG Yanxun & Jl Lijun Institute of Mathematics, Beijing Jiaotong University, Beijing 100044, China,Department of Mathematics, Suzhou University, Suzhou 215006, China.The spectrum for large sets of pure directed triple systems[J].Science China Mathematics,2006,49(8):1103-1127. 被引量：9
