scientific article; zbMATH DE number 857070
From MaRDI portal
Publication:4870158
zbMATH Open0845.05049MaRDI QIDQ4870158FDOQ4870158
Authors: Du Ding-Zhu, Feng Cao, D. Frank Hsu
Publication date: 17 March 1996
Title of this publication is not available (Why is that?)
Recommendations
Directed graphs (digraphs), tournaments (05C20) Eulerian and Hamiltonian graphs (05C45) Distance in graphs (05C12) Connectivity (05C40)
Cited In (24)
- On endo-Cayley digraphs: the Hamiltonian property
- Design and serial construction of digraph braids
- Bounds on the absorbant number of generalized Kautz digraphs
- A unified formulation of Kautz network and generalized hypercube
- Trade-offs among degree, diameter, and number of paths
- Generalized de Bruijn digraphs and the distribution of patterns in \(\alpha\)-expansions
- Miscellaneous Digraph Classes
- Adjacency polynomials of digraph transformations
- An algebraic analysis of the connectivity of De Bruijn and shuffle- exchange digraphs
- Isomorphisms of the De Bruijn digraph and free‐space optical networks
- On the domination numbers of generalized de Bruijn digraphs and generalized Kautz digraphs
- The Cayley digraph associated to the Kautz digraph.
- The independence number for de Bruijn networks and Kautz networks
- Uniform homomorphisms of de Bruijn and Kautz networks
- Connectivity in directed hypergraphs
- Fault tolerant token ring embedding in double loop networks.
- Title not available (Why is that?)
- Sandpile groups of generalized de Bruijn and Kautz graphs and circulant matrices over finite fields
- Title not available (Why is that?)
- Generalized de Bruijn digraphs
- Classification of de Bruijn-based labeled digraphs
- Connectivity of Regular Directed Graphs with Small Diameters
- Comments on "Line digraph iterations and connectivity analysis of de Bruijn and Kautz graphs"
- The Hamiltonian property of the consecutive-3 digraphs
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4870158)