Independent spanning trees with small depths in iterated line digraphs

Discrete Applied Mathematics

Volumn 110, Issue 2-3, 2001, Pages 189-211

  Hasunuma, Toru ^a   Nagamochi, Hiroshi ^b  

^a UNIVERSITY OF ELECTRO COMMUNICATIONS   (Japan)

^b TOYOHASHI UNIVERSITY OF TECHNOLOGY   (Japan)

Author keywords

Broadcasting; De Bruijn digraphs; Independent spanning trees; Interconnection networks; Kautz digraphs; Line digraphs; Vertex connectivity

Indexed keywords

EID: 0035877302     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0166-218X(00)00269-9     Document Type: Article

References (26)

1. Bermond J.-C., Fraigniaud P. Broadcasting and gossiping in de Bruijn networks. SIAM J. Comput. 23:1994;212-225.
2. Bermond J.-C., Peyrat C. de Bruijn and Kautz networks: a competition for the hypercube? André F., Verjus J.P. Hypercube and Distributed Computers. 1989;279-293 North-Holland, Amsterdam.
3. Cheriyan J., Maheshwari S.N. Finding nonseparating induced cycles and independent spanning trees in 3-connected graphs. J. Algorithms. 9:1988;507-537.
4. Du D.Z., Hsu D.F., Lyuu Y.D. On the diameter vulnerability of Kautz digraphs. Discrete Math. 151:1996;81-85.
5. Edmonds J. Submodular functions, matroids and certain polyhedra. Guy R.et al. Combinatorial Structures and Their Applications. 1969;69-87 Gordon and Breach, New York.
6. Fiol M.A., Yebra J.L.A., Alegre I. Line-digraph iterations and the (d,k) problem. IEEE Trans. Comput. C-33:1984;400-403.
7. Fraigniaud P., Lazard E. Methods and problems of communication in usual networks. Discrete Appl. Math. 53:1994;79-133.
8. Gabow H.N. A matroid approach to finding edge connectivity and packing arborescences. J. Comput. System Sci. 50:1995;259-273.
9. Ge Z., Hakimi S.L. Disjoint rooted spanning trees with small depths in de Bruijn and Kautz graphs. SIAM J. Comput. 26:1997;79-92.
10. Hasunuma T., Shibata Y. Counting small cycles in generalized de Bruijn digraphs. Networks. 29:1997;39-47.
11. Hsu D.F. On container width and length in graphs, groups, and networks. IEICE Trans. E77-A:1994;668-680.
12. Huck A. Independent trees in graphs. Graphs and Combin. 10:1994;29-45.
13. Huck A. Disproof of a conjecture about independent spanning trees in. k -connected directed graphs J. Graph Theory. 20:1995;235-239.
14. Huck A. Independent trees in planar graphs. Graphs and Combin. 15:1999;29-77.
15. Huck A. Independent branchings in acyclic digraphs. Discrete Math. 199:1999;245-249.
16. Imase M., Soneoka T., Okada K. Fault-tolerant processor interconnection networks. Systems Comput. Japan. 17:1986;21-30.
17. Itai A., Rodeh M. The multi-tree approach to reliability in distributed networks. Inform. and Comput. 79:1988;43-59.
18. Khuller S., Schieber B. On independent spanning trees. Inform. Process. Lett. 42:1992;321-323.
19. Lovász L. On two minimax theorems in graph theory. J. Combin. Theory Ser. B. 21:1976;96-103.
20. Obokata K., Iwasaki Y., Bao F., Igarashi Y. Independent spanning trees in product graphs and their construction. IEICE Trans. E79-A:1996;1894-1903.
21. Padró C., Morillo P. Diameter vulnerability of iterated line digraphs. Discrete Math. 149:1996;189-204.
22. Schrijver A. Fractional packing and covering. Schrijver A. Packing and Covering in Combinatorics. 1979;201-274 Mathematical Centrum, Amsterdam.
23. Tarjan R.E. A good algorithm for edge-disjoint branchings. Inform. Process. Lett. 3:1974;51-53.
24. Tong P., Lawler E.L. A fast algorithm for finding edge-disjoint branchings. Inform. Process. Lett. 17:1983;73-76.
25. Whitty R.W. Vertex-disjoint paths and edge-disjoint branchings in directed graphs. J. Graph Theory. 11:1987;349-358.
26. Zehavi A., Itai A. Three tree-paths. J. Graph Theory. 13:1989;175-188.