A Design for Directed Graphs with Minimum Diameter

DOI10.1109/TC.1983.1676323MaRDI QIDQ3663185zbMATH OpenOpenAlexFDO

Authors 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

directed graphsswitching systemscomputer networksoptimum solutiondiameter minimization

Mathematics Subject Classification ID

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

Cited in

(49)

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

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

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