On the minimum path problem in Knödel graphs
From MaRDI portal
Publication:3593374
DOI10.1002/net.20169zbMath1125.05056MaRDI 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
90C35: Programming involving graphs or networks
90B18: Communication networks in operations research
68M10: Network design and communication in computer systems
68R10: Graph theory (including graph drawing) in computer science
05C38: Paths and cycles
05C85: Graph algorithms (graph-theoretic aspects)
11A63: Radix representation; digital problems
11K16: Normal numbers, radix expansions, Pisot numbers, Salem numbers, good lattice points, etc.
Related Items
Total domination in cubic Knodel graphs, Unnamed Item, Further contributions to network optimization, 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, A new construction of broadcast graphs, On equitable colouring of Knödel graphs