On a composition of digraphs

Simple item page
dc.creatorSeverini, Simone
dc.date2003-04-30
dc.date.accessioned2026-07-07T03:19:38Z
dc.date.available2026-07-07T03:19:38Z
dc.descriptionMany "good" topologies for interconnection networks are based on line digraphs of regular digraphs. These digraphs support unitary matrices. We propose the property "being the digraph of a unitary matrix" as additional criterion for the design of new interconnection networks. We define a composition of digraphs, which we call diagonal union. Diagonal union can be used to construct digraphs of unitary matrices. We remark that digraphs obtained via diagonal union are state split graphs, as defined in symbolic dynamics. Finally, we list some potential directions for future research.
dc.description6 pages, 1 figure. Abstract accepted for the Third Haifa Workshop on Interdisciplinary Applications of Graph Theory, Combinatorics and Algorithms, May 27-29, 2003, Haifa, Israel
dc.identifierhttps://arxiv.org/abs/cs/0304045
dc.identifierhttp://arxiv.org/abs/cs/0304045
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/31542
dc.subjectDiscrete Mathematics
dc.subjectHardware Architecture
dc.subjectNetworking and Internet Architecture
dc.subjectPrimary 05C20; Secondary 68R10
dc.titleOn a composition of digraphs
dc.typetext

Files

Collections

arXiv