The (, D) and (, N) problems or New Amsterdam and Manhattan digraphs

MaRDI QIDQ2443422zbMATH OpenFDO

Authors C. Dalfó, Miquel Angel Fiol

Publication date 7 April 2014

Published in AKCE International Journal of Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1210.6202

zbMATH Keywords

(\(\Delta, D\)) problem(\(\Delta, N\)) problemManhattan digraphNew Amsterdam digraph

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10)

Abstract: We give a quasi-complete solution of the (Delta,N) problem for two well-known families of digraphs used as good models for large interconnection networks. In our study we also relate both families, the New Amsterdam and Manhattan digraphs, with the double-step graphs (or circulant graphs with degree two).

Recommendations

• scientific article; zbMATH DE number 6302970
• The (, D) and (,N) problems in double-step digraphs with unilateral distance
• The Manhattan product of digraphs
• scientific article; zbMATH DE number 4055643
• The \((\Delta{} , d, d', \Delta{} - 1)\)-problem with applications to computer networks

Cited in

(2)

• The (, D) and (,N) problems in double-step digraphs with unilateral distance
• scientific article; zbMATH DE number 6302970 (Why is no real title available?)

This page was built for publication: The (\(\Delta, D\)) and (\(\Delta, N\)) problems or New Amsterdam and Manhattan digraphs

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