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

DOI10.1137/S0097539793244198zbMATH Open0874.05020OpenAlexW1974997494MaRDI QIDQ4337433FDOQ4337433

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

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

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)

Cited In (23)

• Title not available (Why is that?)
• Parallel construction of optimal independent spanning trees on Cartesian product of complete graphs
• Independent spanning trees in crossed cubes
• Completely independent spanning trees in some regular graphs
• Miscellaneous Digraph Classes
• Constructing independent spanning trees for locally twisted cubes
• Independent spanning trees vs. edge-disjoint spanning trees in locally twisted cubes
• Superfluous edges and exponential expansions of de Bruijn and Kautz graphs
• On edge-disjoint spanning trees with small depths
• Independent spanning trees on even networks
• De Bruijn and Kautz digraphs of a rooted tree
• Independent spanning trees on folded hyper-stars
• An improved algorithm to construct edge-independent spanning trees in augmented cubes
• Title not available (Why is that?)
• Completely independent spanning trees in torus networks
• Broadcasting secure messages via optimal independent spanning trees in folded hypercubes
• Independent spanning trees with small depths in iterated line digraphs
• CONSTRUCTING MULTIPLE INDEPENDENT SPANNING TREES ON RECURSIVE CIRCULANT GRAPHS G(2^m, 2)
• Broadcasting and spanning trees in de Bruijn and Kautz networks
• Construction of optimal independent spanning trees on folded hypercubes
• Almost disjoint spanning trees: relaxing the conditions for completely independent spanning trees
• Constructing Node-Independent Spanning Trees in Augmented Cubes
• On the independent spanning trees of recursive circulant graphs \(G(cd^m,d)\) with \(d>2\)

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)