Digraphs that have at most one walk of a given length with...

Discrete Mathematics 2011 Vol. 311; Iss. 1

Digraphs that have at most one walk of a given length with the same endpoints

Zejun Huang, Xingzhi Zhan
How much do you like this book?
What’s the quality of the file?
Download the book for quality assessment
What’s the quality of the downloaded files?
Volume:
311
Year:
2011
Language:
english
Pages:
10
DOI:
10.1016/j.disc.2010.09.025
File:
PDF, 245 KB
english, 2011
Conversion to is in progress
Conversion to is failed