Degree diameter problem on triangular networks

MaRDI QIDQ3451463zbMATH OpenFDO

Authors Přemysl Holub, Joe Ryan

Publication date 16 November 2015

Full work available at URL http://ajc.maths.uq.edu.au//pdf/63/ajc_v63_p333.pdf

zbMATH Keywords

host graphmultidimensional rectangular meshtriangular grid

Mathematics Subject Classification ID

Vertex degrees (05C07) Distance in graphs (05C12) Extremal problems in graph theory (05C35) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Recommendations

• Degree diameter problem on silicate network
• Degree diameter problem on honeycomb networks
• Optimal graphs in the enhanced mesh networks
• Large graphs with given degree and diameter. II
• Moore graphs and beyond: a survey of the degree/diameter problem

Cited in

(7)

• On calculating the packing efficiency for embedding hexagonal and dodecagonal sensors in a circular container
• The maximum degree and diameter-bounded subgraph in the mesh
• MaxDDBS problem on butterfly networks
• Degree diameter problem on honeycomb networks
• Degree diameter problem on silicate network
• The degree-diameter problem for plane graphs with pentagonal faces
• Optimal graphs in the enhanced mesh networks

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

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