On broadcast schemes of Knödel graphs

DOI10.1142/s0129626424500099MaRDI QIDQ6656780

Hovhannes A. Harutyunyan, [[Person:6093496|Author name not available (Why is that?)]]

Publication date: 3 January 2025

Published in: Parallel Processing Letters (Search for Journal in Brave)

zbMATH Keywords

Knödel graphbroadcast scheme

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Upper bounds on the broadcast function using minimum dominating sets
• Sparse broadcast graphs
• New gossips and telephones
• Minimum broadcast graphs
• Compound constructions of broadcast networks
• Methods and problems of communication in usual networks
• A survey on Knödel graphs.
• Dissemination of information in communication networks. Broadcasting, gossiping, leader election, and fault-tolerance.
• On the monotonicity of the broadcast function
• More broadcast graphs
• The shortest path problem in the Knödel graph
• An Efficient Vertex Addition Method for Broadcast Networks
• A survey of gossiping and broadcasting in communication networks
• A Note on the Dimensionality of Modified Knödel Graphs
• Antepenultimate broadcasting
• Minimum multiple message broadcast graphs
• Complete rotations in Cayley graphs
• Broadcast graphs using new dimensional broadcast schemes for Knödel graphs

This page was built for publication: On broadcast schemes of Knödel graphs

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