A Note on the Dimensionality of Modified Knödel Graphs

DOI10.1142/S0129054197000094MaRDI QIDQ4358513zbMATH OpenOpenAlexFDO

Authors Jean-Claude Bermond, Hovhannes A. Harutyunyan, Arthur L. Liestman, Stéphane Pérennes

Publication date 20 November 1997

Published in International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/s0129054197000094

zbMATH Keywords

Knödel graph

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Network design and communication in computer systems (68M10)

Recommendations

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

Cited in

(19)

• On equitable colouring of Knödel graphs
• On linear-time data dissemination in dynamic rooted trees
• Domination in 4-regular Knödel graphs
• The shortest path problem in the Knödel graph
• Upper bounds on the broadcast function using minimum dominating sets
• Power domination in Knödel graphs and Hanoi graphs
• Diameter of General Knödel Graphs
• Domination in Kn\"odel Graphs
• A new construction of broadcast graphs
• Broadcast graphs using new dimensional broadcast schemes for Knödel graphs
• Gossiping and routing in second-kind Frobenius graphs
• Some properties of the Knödel graph \(W(k,2^k)\), \(k\geq 4\)
• More broadcast graphs
• A survey on Knödel graphs.
• A new construction of broadcast graphs
• Efficient construction of broadcast graphs
• On broadcast schemes of Knödel graphs
• Broadcast graphs using new dimensional broadcast schemes for Knödel graphs
• Total domination in cubic Knodel graphs

This page was built for publication: A Note on the Dimensionality of Modified Knödel Graphs

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