Tight Bound on the Diameter of the Knödel Graph

DOI10.1007/978-3-642-45278-9_18zbMath1359.05122OpenAlexW51026761MaRDI QIDQ2870028

Hovhannes A. Harutyunyan, Hayk A. Grigoryan

Publication date: 17 January 2014

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-45278-9_18

zbMATH Keywords

broadcastingKnödel graphminimum broadcast graphdiametral path

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Distance in graphs (05C12) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (4)

Unnamed Item ⋮ 2-power domination number for Knödel graphs and its application in communication networks ⋮ Domination in 4-regular Knödel graphs ⋮ The shortest path problem in the Knödel graph

This page was built for publication: Tight Bound on the Diameter of the Knödel Graph