Degree diameter problem on honeycomb networks

DOI10.1016/j.dam.2014.07.012zbMath1303.05048OpenAlexW2016060900MaRDI QIDQ477344

Mirka Miller, Přemysl Holub, Hebert Pérez-Rosés, Joseph F. Ryan

Publication date: 3 December 2014

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2014.07.012

zbMATH Keywords

network designdegree-diameter problemhoneycomb grid

Mathematics Subject Classification ID

Trees (05C05) 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) Distance in graphs (05C12)

Related Items (1)

Optimal graphs in the enhanced mesh networks

Uses Software

• OEIS

Cites Work

• Unnamed Item
• Unnamed Item
• The maximum degree and diameter-bounded subgraph in the mesh
• The maximum degree \& diameter-bounded subgraph and its applications
• Reducibility among Combinatorial Problems

This page was built for publication: Degree diameter problem on honeycomb networks