On the minimum path problem in Knödel graphs

DOI10.1002/net.20169zbMath1125.05056OpenAlexW4230596415MaRDI QIDQ3593374

Calin D. Morosan, Hovhannes A. Harutyunyan

Publication date: 20 July 2007

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.20169

zbMATH Keywords

shortest pathapproximation algorithminterconnection networkKnödel graph

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Communication networks in operations research (90B18) Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Paths and cycles (05C38) Graph algorithms (graph-theoretic aspects) (05C85) Radix representation; digital problems (11A63) Normal numbers, radix expansions, Pisot numbers, Salem numbers, good lattice points, etc. (11K16)

Related Items (8)

Unnamed Item ⋮ On equitable colouring of Knödel graphs ⋮ A new construction of broadcast graphs ⋮ Gossiping and routing in second-kind Frobenius graphs ⋮ Upper bounds on the broadcast function using minimum dominating sets ⋮ The shortest path problem in the Knödel graph ⋮ Further contributions to network optimization ⋮ Total domination in cubic Knodel graphs

This page was built for publication: On the minimum path problem in Knödel graphs