Completely independent spanning trees in the underlying graph of a line digraph (Q5936061)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1612922
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Completely independent spanning trees in the underlying graph of a line digraph |
scientific article; zbMATH DE number 1612922 |
Statements
Completely independent spanning trees in the underlying graph of a line digraph (English)
0 references
2 May 2002
0 references
Trees \(T_1,\dots,T_k\) are completely independent spanning trees in a graph \(H\), if for any vertex \(r\) in \(H\) they are independent spanning trees rooted at \(r\). The paper gives a characterization of completely independent spanning trees. Further, it is shown that for any \(k\)-vertex-connected line digraph \(L(G)\), there are \(k\) completely independent spanning trees in the underlying graph of \(L(G)\).
0 references
de Bruijn graph
0 references
independent spanning tree
0 references
Kautz graph
0 references
wrapped butterfly
0 references
line digraph
0 references
0.97748494
0 references
0.9400656
0 references
0.9265704
0 references
0.9253917
0 references
0.9238868
0 references
0.91668606
0 references
0 references
