Degree diameter problem on honeycomb networks

DOI10.1016/J.DAM.2014.07.012MaRDI QIDQ477344zbMATHOpenAlexFDO

Authors Přemysl Holub, Mirka Miller, Hebert Pérez-Rosés, Joe 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) Graph theory (including graph drawing) in computer science (68R10) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Distance in graphs (05C12) Network design and communication in computer systems (68M10)

Recommendations

• Degree diameter problem on triangular networks
• Degree diameter problem on silicate network
• Optimal graphs in the enhanced mesh networks
• The maximum degree and diameter-bounded subgraph in the mesh
• Moore graphs and beyond: a survey of the degree/diameter problem

Cites work

• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• Graph theory
• Reducibility among combinatorial problems
• The maximum degree \& diameter-bounded subgraph and its applications
• The maximum degree and diameter-bounded subgraph in the mesh

Cited in

(5)

• Degree diameter problem on triangular networks
• Optimal graphs in the enhanced mesh networks
• Unraveling the enigmatic irregular coloring of honeycomb networks
• MaxDDBS problem on butterfly networks
• Degree diameter problem on silicate network

Describes a project that uses

Uses Software

• OEIS

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

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