In this paper,we first construct a subset-bipartite graph(n,k,i)by k-subsetsand(k+i)-subsets of set[n]={1,2.....n},through computation and analy-sis to its parameters,we give its complete classification in terms of the regularityof bipartite graphs.Secondly,we construct a subspace-bipartite graph[n,k,i]byk-dimensional and(k+i)-dimensional subspaces of n-dimensional vector spaceFq(n),and give similar discussion to above chapter.In the last chapter,we constructa bipartite graph by all 1-dimensional subspaces and all maximal totally isotropicsubspaces of symplectic space,and obtain that this graph is a distance-semiregulargraph,its bipartite half is the complement of symplectic graph.... |