The (Delta,D) and (Delta,N) problems for New Amsterdam and Manhattan digraphs
classification
🧮 math.CO
cs.DM
keywords
deltadigraphsamsterdamfamiliesgraphsmanhattancirculantdegree
read the original 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).
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.