Diameter of General Knödel Graphs

DOI10.3233/fi-222165arXiv2004.05435MaRDI QIDQ6145626

Seyed Reza Musawi, Esmaeil Nazari

Publication date: 2 February 2024

Published in: Fundamenta Informaticae (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2004.05435

zbMATH Keywords

distancediameterKnödel graph

Mathematics Subject Classification ID

Computer science (68-XX)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Upper bounds on the broadcast function using minimum dominating sets
• New gossips and telephones
• Methods and problems of communication in usual networks
• A survey on Knödel graphs.
• Domination in 4-regular Knödel graphs
• The shortest path problem in the Knödel graph
• Minimum linear gossip graphs and maximal linear (?,k)-gossip graphs
• A survey of gossiping and broadcasting in communication networks
• Information Dissemination in Trees
• A Note on the Dimensionality of Modified Knödel Graphs
• Total domination in cubic Knodel graphs

This page was built for publication: Diameter of General Knödel Graphs