The partial line digraph technique in the design of large interconnection networks

DOI10.1109/12.256453zbMath1395.68029OpenAlexW2133931265MaRDI QIDQ5375351

Anna S. Lladó, Miquel Àngel Fiol

Publication date: 14 September 2018

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

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

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Directed graphs (digraphs), tournaments (05C20)

Related Items (9)

The diameter of cyclic Kautz digraphs ⋮ The spectra of some families of digraphs ⋮ Unnamed Item ⋮ A characterization of partial directed line graphs ⋮ Relation between number of kernels (and generalizations) of a digraph and its partial line digraphs ⋮ Spectra of digraphs ⋮ Kernels and partial line digraphs ⋮ About \((k, l)\)-kernels, semikernels and Grundy functions in partial line digraphs ⋮ Superfluous edges and exponential expansions of de Bruijn and Kautz graphs

This page was built for publication: The partial line digraph technique in the design of large interconnection networks