On the minimum path problem in Knödel graphs

DOI10.1002/NET.20169zbMATH Open1125.05056OpenAlexW4230596415MaRDI QIDQ3593374FDOQ3593374

Authors: Hovhannes A. Harutyunyan, Calin D. Morosan 

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

Recommendations

• The shortest path problem in the Knödel graph
• The spectra of Knödel graphs
• A survey on Knödel graphs.
• Tight bound on the diameter of the Knödel graph
• Some properties of the Knödel graph \(W(k,2^k)\), \(k\geq 4\)

zbMATH Keywords

approximation algorithmshortest pathinterconnection networkKnödel graph

Mathematics Subject Classification ID

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

Cited In (14)

• Graph path minimization problem
• The shortest path problem in the Knödel graph
• Diameter of General Knödel Graphs
• Upper bounds on the broadcast function using minimum dominating sets
• Tight bound on the diameter of the Knödel graph
• Gossiping and routing in second-kind Frobenius graphs
• Some properties of the Knödel graph \(W(k,2^k)\), \(k\geq 4\)
• Further contributions to network optimization
• A new construction of broadcast graphs
• The crossing number of Knödel graph \(W_{3,n}\)
• The spectra of Knödel graphs
• Total domination in cubic Knodel graphs
• On equitable colouring of Knödel graphs
• Title not available (Why is that?)

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

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