Full-Text Search:
Home|Journal Papers|About CNKI|User Service|FAQ|Contact Us|中文
《Journal of Qinghai Normal University(Natural Science Edition)》 1991-01
Add to Favorite Get Latest Update

THE ISOMORPHISM PROBLEM OF 2-CIRCULANT DIGRAPH

Qian Jianguo (Department of Mathematics)  
The vertex set of 2-circulant digraph is V(G(a,b,N))={0,1,2,…,N-1}. For any i,j∈V (G(a,b,N)),i is adjacent to j if and only if j≡i+a(mod N), or j≡i+b (mod N),where integral numbers N,a,b,satisfy N2,1≤a≠b≤N-1. This paper has solved the isomorphism problem of 2-circulant digraph.
Download(CAJ format) Download(PDF format)
CAJViewer7.0 supports all the CNKI file formats; AdobeReader only supports the PDF format.
©2006 Tsinghua Tongfang Knowledge Network Technology Co., Ltd.(Beijing)(TTKN) All rights reserved