Title of article
Independent spanning trees with small depths in iterated line digraphs Original Research Article
Author/Authors
Toru Hasunuma، نويسنده , , Hiroshi Nagamochi، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2001
Pages
23
From page
189
To page
211
Abstract
We show that the independent spanning tree conjecture on digraphs is true if we restrict ourselves to line digraphs. Also, we construct independent spanning trees with small depths in iterated line digraphs. From the results, we can obtain independent spanning trees with small depths in de Bruijn and Kautz digraphs that improve the previously known upper bounds on the depths.
Keywords
Independent spanning trees , Line digraphs , Kautz digraphs , De Bruijn digraphs , Vertex connectivity , Broadcasting , interconnection networks
Journal title
Discrete Applied Mathematics
Serial Year
2001
Journal title
Discrete Applied Mathematics
Record number
885218
Link To Document