Degree diameter problem on silicate network

MaRDI QIDQ4989597zbMATH OpenFDO

Authors Muhammad Shahzad Akhtar, Syed Ahtsham Ul Haq Bokhary

Publication date 25 May 2021

zbMATH Keywords

closed balldegreediameteroxygen edgeoxygen vertexsilicate networksilicon edgetetrahedron

Mathematics Subject Classification ID

Vertex degrees (05C07) Distance in graphs (05C12) Coloring of graphs and hypergraphs (05C15) Enumeration in graph theory (05C30)

Recommendations

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

Cited in

(6)

• Minimum metric dimension of silicate networks.
• Degree diameter problem on triangular networks
• The maximum degree and diameter-bounded subgraph in the mesh
• MaxDDBS problem on butterfly networks
• Degree diameter problem on honeycomb networks
• Optimal graphs in the enhanced mesh networks

This page was built for publication: Degree diameter problem on silicate network

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