On the minimum path problem in Knödel graphs
From MaRDI portal
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) Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Communication networks in operations research (90B18) Programming involving graphs or networks (90C35)
Recommendations
Cited in
(15)- The shortest path problem in the Knödel graph
- A new construction of broadcast graphs
- Tight bound on the diameter of the Knödel graph
- On equitable colouring of Knödel graphs
- The spectra of Knödel graphs
- The crossing number of Knödel graph \(W_{3,n}\)
- Gossiping and routing in second-kind Frobenius graphs
- A Note on the Dimensionality of Modified Knödel Graphs
- Upper bounds on the broadcast function using minimum dominating sets
- scientific article; zbMATH DE number 1420912 (Why is no real title available?)
- Total domination in cubic Knodel graphs
- Some properties of the Knödel graph W(k,2ᵏ), k 4
- Further contributions to network optimization
- Diameter of General Knödel Graphs
- Graph path minimization problem
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)