Full-Text Search:
Home|Journal Papers|About CNKI|User Service|FAQ|Contact Us|中文
《Applied Mathematics A Journal of Chinese Universities》 1986-02
Add to Favorite Get Latest Update


Shao Jiayu (Tongji University)  
In (2), Harary et al defined a free-cyclic digraph and proposed the unsol-ved problem of characterizing the free-cyclic digraphs. In this paper we will show that the following conditions of a digraph D are equivalent: (1). D is free-cyclic, (2). D contains no cycle having two independent diagonal paths, (3). D contains no subdigraph whish can. be obtained from the double eycle Ck (k≥2) by finitely many subdivisions and splittings.
Download(CAJ format) Download(PDF format)
CAJViewer7.0 supports all the CNKI file formats; AdobeReader only supports the PDF format.
Chinese Journal Full-text Database 1 Hits
1 ZHIXIANG Hu(Department of Applied Mathematics. Tonyji University, Shanghai, 200092);The Characterizations of S~2NS Digraphs with the Number of Components ≤ 7 in Terms of Forbidden Configurations[J];Communication On Applied Mathematics and Computation;1998-02
©2006 Tsinghua Tongfang Knowledge Network Technology Co., Ltd.(Beijing)(TTKN) All rights reserved