Connectivity of Regular Directed Graphs with Small Diameters

DOI10.1109/TC.1985.1676569zbMath0554.05044OpenAlexW1729503770MaRDI QIDQ3216689

Makoto Imase, Terunao Soneoka, Keiji Okada

Publication date: 1985

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

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

zbMATH Keywords

digraph communication networks interconnection networks directed graphs edge connectivity connectivity maximisation diameter minimisation diamter

Mathematics Subject Classification ID

Paths and cycles (05C38) Applications of graph theory to circuits and networks (94C15) Directed graphs (digraphs), tournaments (05C20) Connectivity (05C40)

Related Items (46)

On the number of cycles in generalized Kautz digraphs ⋮ Sufficient conditions for maximally connected dense graphs ⋮ Lower bounds on the vertex-connectivity of digraphs and graphs ⋮ Isomorphic factorization, the Kronecker product and the line digraph ⋮ On fault-tolerant embedding of Hamiltonian circuits in line digraph interconnection networks ⋮ An algebraic analysis of the connectivity of De Bruijn and shuffle- exchange digraphs ⋮ Extension of de Bruijn graph and Kautz graph ⋮ On the connectivity of the De Bruijn graph ⋮ Connectivity of graphs with given girth pair ⋮ Design of a \(d\)-connected digraph with a minimum number of edges and a quasiminimal diameter. II ⋮ Large fault-tolerant interconnection networks ⋮ Connectivity of large bipartite digraphs and graphs ⋮ Fault-tolerant routings in Kautz and de Bruijn networks ⋮ Lower connectivities of regular graphs with small diameter ⋮ Super line-connectivity of consecutive-\(d\) digraphs ⋮ Broadcasting and gossiping on de Bruijn, shuffle-exchange and similar networks ⋮ Superconnectivity of graphs with odd girth \(g\) and even girth \(h\) ⋮ On the \(k\)-tuple domination of generalized de Brujin and Kautz digraphs ⋮ Distance domination of generalized de Bruijn and Kautz digraphs ⋮ The \(k\)-tuple twin domination in generalized de Bruijn and Kautz networks ⋮ Radial Moore graphs of radius three ⋮ Design of a d-connected digraph with a minimum number of edges and a quasiminimal diameter ⋮ Maximally edge-connected and vertex-connected graphs and digraphs: A survey ⋮ Efficient twin domination in generalized de Bruijn digraphs ⋮ On the edge-connectivity and restricted edge-connectivity of a product of graphs ⋮ Twin domination in generalized Kautz digraphs ⋮ Connectivity of Kautz networks ⋮ Connectivity of consecutive-\(d\) digraphs ⋮ Super edge-connectivity of dense digraphs and graphs ⋮ On the \(\lambda ^{\prime}\)-optimality in graphs with odd girth \(g\) and even girth \(h\) ⋮ On the connectivity and superconnected graphs with small diameter ⋮ An inequality relating the order, maximum degree, diameter and connectivity of a strongly connected digraph ⋮ The twin domination number in generalized de Bruijn digraphs ⋮ On the connectivity of semiregular cages ⋮ On the girth of extremal graphs without shortest cycles ⋮ On efficient absorbant conjecture in generalized De Bruijn digraphs ⋮ Calculating the extremal number \(ex(v;\{C_3,C_4,\dots,C_n\})\) ⋮ Edge-superconnectivity of semiregular cages with odd girth ⋮ Degree sequence conditions for maximally edge-connected oriented graphs ⋮ Superconnectivity of bipartite digraphs and graphs ⋮ Miscellaneous Digraph Classes ⋮ On the Superconnectivity in graphs with odd girth g and even girth h ⋮ Constructing the minimum dominating sets of generalized de Bruijn digraphs ⋮ The superconnectivity of large digraphs and graphs ⋮ Factorization of de Bruijn digraphs by cycle-rooted trees ⋮ Trade-offs among degree, diameter, and number of paths

This page was built for publication: Connectivity of Regular Directed Graphs with Small Diameters