ISCAS OpenIR
On the number of spanning trees and Eulerian tours in iterated line digraphs
Zhang Huaxiao; Zhang Fuji; Huang Qiongxiang
1997
SourceDiscrete Applied Mathematics
Volume73Issue:1Pages:59-67
Indexed Type其他
Cooperation Status其它
Language中文
Content Type期刊论文
URIhttp://ir.iscas.ac.cn/handle/311060/1215
Collection中国科学院软件研究所
Recommended Citation
GB/T 7714
Zhang Huaxiao,Zhang Fuji,Huang Qiongxiang. On the number of spanning trees and Eulerian tours in iterated line digraphs[J]. Discrete Applied Mathematics,1997,73(1):59-67.
APA Zhang Huaxiao,Zhang Fuji,&Huang Qiongxiang.(1997).On the number of spanning trees and Eulerian tours in iterated line digraphs.Discrete Applied Mathematics,73(1),59-67.
MLA Zhang Huaxiao,et al."On the number of spanning trees and Eulerian tours in iterated line digraphs".Discrete Applied Mathematics 73.1(1997):59-67.
Files in This Item:
File Name/Size DocType Version Access License
111677.pdf(393KB) 开放获取LicenseApplication Full Text
Related Services
Recommend this item
Bookmark
Usage statistics
Export to Endnote
Google Scholar
Similar articles in Google Scholar
[Zhang Huaxiao]'s Articles
[Zhang Fuji]'s Articles
[Huang Qiongxiang]'s Articles
Baidu academic
Similar articles in Baidu academic
[Zhang Huaxiao]'s Articles
[Zhang Fuji]'s Articles
[Huang Qiongxiang]'s Articles
Bing Scholar
Similar articles in Bing Scholar
[Zhang Huaxiao]'s Articles
[Zhang Fuji]'s Articles
[Huang Qiongxiang]'s Articles
Terms of Use
No data!
Social Bookmark/Share
All comments (0)
No comment.
 

Items in the repository are protected by copyright, with all rights reserved, unless otherwise indicated.