A Design for Directed Graphs with Minimum Diameter

DOI10.1109/TC.1983.1676323zbMath0515.94027OpenAlexW2063999066MaRDI QIDQ3663185

Makoto Imase, Masaki Itoh

Publication date: 1983

Published in: IEEE Transactions on Computers (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/tc.1983.1676323

zbMATH Keywords

switching systemsdirected graphscomputer networksoptimum solutiondiameter minimization

Mathematics Subject Classification ID

Applications of graph theory to circuits and networks (94C15)

Related Items (49)

On the number of cycles in generalized Kautz digraphs ⋮ Sufficient conditions for maximally connected dense graphs ⋮ Partial line directed hypergraphs ⋮ Connectivity and fault-tolerance of hyperdigraphs ⋮ On the \(k\)-tuple domination of de Bruijn and Kautz digraphs ⋮ Vertex in-magic arc labelings of digraphs ⋮ \(E\)-super vertex in-magic total labelings of digraphs ⋮ IEH graphs. A novel generalization of hypercube graphs ⋮ Extension of de Bruijn graph and Kautz graph ⋮ Diameter vulnerability of iterated line digraphs ⋮ The Hamiltonian property of the consecutive-3 digraphs ⋮ Design of a \(d\)-connected digraph with a minimum number of edges and a quasiminimal diameter. II ⋮ Large fault-tolerant interconnection networks ⋮ Super line-connectivity of consecutive-\(d\) digraphs ⋮ Broadcasting and gossiping on de Bruijn, shuffle-exchange and similar networks ⋮ A generalization of de Bruijn graphs and classification of endomorphisms of Cuntz algebras by graph invariants ⋮ An Exact Method for the Minimum Feedback Arc Set Problem ⋮ On the \(k\)-tuple domination of generalized de Brujin and Kautz digraphs ⋮ New bounds on the decycling number of generalized de Bruijn digraphs ⋮ Super link-connectivity of iterated line digraphs. ⋮ The \(k\)-tuple twin domination in generalized de Bruijn and Kautz networks ⋮ Sandpile groups of generalized de Bruijn and Kautz graphs and circulant matrices over finite fields ⋮ On the decycling number of generalized Kautz digraphs ⋮ Efficient twin domination in generalized de Bruijn digraphs ⋮ The Hamiltonian property of generalized de Bruijn digraphs ⋮ On the numbers of spanning trees and Eulerian tours in generalized de Bruijn graphs ⋮ On the number of spanning trees and Eulerian tours in iterated line digraphs ⋮ Bounds on the absorbant number of generalized Kautz digraphs ⋮ Twin domination in generalized Kautz digraphs ⋮ Practical construction of ring LFSRs and ring FCSRs with low diffusion delay for hardware cryptographic applications ⋮ Efficient absorbants in generalized de Bruijn digraphs ⋮ Connectivity of Kautz networks ⋮ Connectivity of consecutive-\(d\) digraphs ⋮ Asymptotically-tight bounds on the number of cycles in generalized de Bruijn-Good graphs ⋮ Super edge-connectivity of dense digraphs and graphs ⋮ An inequality relating the order, maximum degree, diameter and connectivity of a strongly connected digraph ⋮ The underlying line digraph structure of some (0, 1)-matrix equations ⋮ On the domination numbers of generalized de Bruijn digraphs and generalized Kautz digraphs ⋮ On efficient absorbant conjecture in generalized De Bruijn digraphs ⋮ Reinforcement numbers of digraphs ⋮ The Hamiltonian property of linear functions ⋮ Large generalized cycles ⋮ Superfluous edges and exponential expansions of de Bruijn and Kautz graphs ⋮ Disjoint paths of bounded length in large generalized cycles ⋮ Power domination in generalized undirected de Bruijn graphs and Kautz graphs ⋮ Miscellaneous Digraph Classes ⋮ Asymptotic enumeration theorems for the numbers of spanning trees and Eulerian trails in circulant digraphs and graphs ⋮ The Hamiltonian property of consecutive-\(d\) digraphs ⋮ Counting closed walks in generalized de Bruijn graphs

This page was built for publication: A Design for Directed Graphs with Minimum Diameter