A survey on Knödel graphs.

DOI10.1016/S0166-218X(03)00260-9zbMath1062.68086MaRDI QIDQ1427198

Guillaume Fertin, Andre Raspaud

Publication date: 14 March 2004

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

GossipingInterconnection networksGraph embeddingsHypercubesBroadcastingKnödel graphsRecursive circulant graphs

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10)

Related Items (21)

Unnamed Item ⋮ Broadcasting multiple messages in the 1-in port model in optimal time ⋮ Frobenius circulant graphs of valency six, Eisenstein-Jacobi networks, and hexagonal meshes ⋮ On equitable colouring of Knödel graphs ⋮ A new construction of broadcast graphs ⋮ Domination in Kn\"odel Graphs ⋮ Forwarding and optical indices of 4-regular circulant networks ⋮ Broadcast graphs using new dimensional broadcast schemes for Knödel graphs ⋮ Literature reviews in operations research: a new taxonomy and a meta review ⋮ Power domination in Knödel graphs and Hanoi graphs ⋮ Time-Optimal Broadcasting of Multiple Messages in 1-in Port Model ⋮ Diameter of General Knödel Graphs ⋮ 2-power domination number for Knödel graphs and its application in communication networks ⋮ Gossiping and routing in second-kind Frobenius graphs ⋮ Broadcast Graphs Using New Dimensional Broadcast Schemes for Knödel Graphs ⋮ Upper bounds on the broadcast function using minimum dominating sets ⋮ Efficient construction of broadcast graphs ⋮ Domination in 4-regular Knödel graphs ⋮ The shortest path problem in the Knödel graph ⋮ A New Construction of Broadcast Graphs ⋮ Total domination in cubic Knodel graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Odd gossiping
• Minimum broadcast digraphs
• New gossips and telephones
• Minimum broadcast graphs
• Methods and problems of communication in usual networks
• Recursive circulants and their embeddings among hypercubes
• On the structure of minimum broadcast digraphs
• On forwarding indices of networks
• A study of minimum gossip graphs
• Minimum linear gossip graphs and maximal linear (?,k)-gossip graphs
• The forwarding index of communication networks
• A survey of gossiping and broadcasting in communication networks
• Minimal broadcast networks
• A Note on the Dimensionality of Modified Knödel Graphs
• Some minimum gossip graphs
• Connectivity of transitive graphs
• Complete rotations in Cayley graphs
• All-to-all wavelength-routing in all-optical compound networks

This page was built for publication: A survey on Knödel graphs.