Connectivity of Imase and Itoh digraphs

DOI10.1109/12.8718zbMath0659.68091OpenAlexW2163380088MaRDI QIDQ3809285

N. Homobono, Claudine Peyrat

Publication date: 1988

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

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

zbMATH Keywords

fault toleranceinterconnection networksvulnerabilitydirected graphscomputer networks

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Applications of graph theory to circuits and networks (94C15) Connectivity (05C40)

Related Items (11)

On the number of cycles in generalized Kautz digraphs ⋮ Partial line directed hypergraphs ⋮ Connectivity and fault-tolerance of hyperdigraphs ⋮ Diameter vulnerability of iterated line digraphs ⋮ Large fault-tolerant interconnection networks ⋮ Super line-connectivity of consecutive-\(d\) digraphs ⋮ Super link-connectivity of iterated line digraphs. ⋮ The \(k\)-tuple twin domination in generalized de Bruijn and Kautz networks ⋮ The Hamiltonian property of generalized de Bruijn digraphs ⋮ Connectivity of consecutive-\(d\) digraphs ⋮ Trade-offs among degree, diameter, and number of paths

This page was built for publication: Connectivity of Imase and Itoh digraphs