Disjoint Rooted Spanning Trees with Small Depths in deBruijn and Kautz Graphs

DOI10.1137/S0097539793244198MaRDI QIDQ4337433zbMATH OpenOpenAlexFDO

Authors Zhengyu Ge, S. Louis Hakimi

Publication date 9 November 1997

Published in SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/s0097539793244198

zbMATH Keywords

spanning treesKautz digraphdeBruijn digraph

Mathematics Subject Classification ID

Trees (05C05) Directed graphs (digraphs), tournaments (05C20) Reliability, testing and fault tolerance of networks and computer systems (68M15) Network design and communication in computer systems (68M10)

Recommendations

• Broadcasting and spanning trees in de Bruijn and Kautz networks
• De Bruijn and Kautz digraphs of a rooted tree
• scientific article; zbMATH DE number 1444313
• scientific article; zbMATH DE number 2075817

Cited in

(24)

• Independent spanning trees in crossed cubes
• scientific article; zbMATH DE number 1444313 (Why is no real title available?)
• Independent spanning trees on even networks
• Independent spanning trees with small depths in iterated line digraphs
• Constructing independent spanning trees for locally twisted cubes
• Almost disjoint spanning trees: relaxing the conditions for completely independent spanning trees
• Completely independent spanning trees in some regular graphs
• Miscellaneous digraph classes
• On the independent spanning trees of recursive circulant graphs \(G(cd^m,d)\) with \(d>2\)
• Parallel construction of optimal independent spanning trees on Cartesian product of complete graphs
• Broadcasting and spanning trees in de Bruijn and Kautz networks
• scientific article; zbMATH DE number 2075817 (Why is no real title available?)
• Broadcasting secure messages via optimal independent spanning trees in folded hypercubes
• Independent spanning trees on folded hyper-stars
• De Bruijn and Kautz digraphs of a rooted tree
• Superfluous edges and exponential expansions of de Bruijn and Kautz graphs
• Construction of optimal independent spanning trees on folded hypercubes
• Constructing node-independent spanning trees in augmented cubes
• CONSTRUCTING MULTIPLE INDEPENDENT SPANNING TREES ON RECURSIVE CIRCULANT GRAPHS G(2^m, 2)
• Completely independent spanning trees in torus networks
• Layer structure of De Bruijn and Kautz digraphs. An application to deflection routing
• On edge-disjoint spanning trees with small depths
• Independent spanning trees vs. edge-disjoint spanning trees in locally twisted cubes
• An improved algorithm to construct edge-independent spanning trees in augmented cubes

This page was built for publication: Disjoint Rooted Spanning Trees with Small Depths in deBruijn and Kautz Graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4337433)