The shortest path problem in the Knödel graph

DOI10.1016/J.JDA.2014.11.008MaRDI QIDQ2018539zbMATHOpenAlexFDO

Authors Hovhannes A. Harutyunyan, Hayk Grigoryan

Publication date 24 March 2015

Published in Journal of Discrete Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.jda.2014.11.008

zbMATH Keywords

shortest path problemKnödel graphdiameter of the Knödel graph

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Extremal problems in graph theory (05C35) Distance in graphs (05C12) Paths and cycles (05C38)

Recommendations

• Tight bound on the diameter of the Knödel graph
• On the minimum path problem in Knödel graphs
• Recognizing Knödel graphs
• A survey on Knödel graphs.
• The spectra of Knödel graphs

Cites work

• scientific article; zbMATH DE number 1696530 (Why is no real title available?)
• scientific article; zbMATH DE number 177869 (Why is no real title available?)
• A Note on the Dimensionality of Modified Knödel Graphs
• A survey of gossiping and broadcasting in communication networks
• A survey on Knödel graphs.
• An Efficient Vertex Addition Method for Broadcast Networks
• Antepenultimate broadcasting
• Complete rotations in Cayley graphs
• Compound constructions of broadcast networks
• Dissemination of information in communication networks. Broadcasting, gossiping, leader election, and fault-tolerance.
• Methods and problems of communication in usual networks
• Minimum broadcast graphs
• Minimum linear gossip graphs and maximal linear \((\Delta,k)\)-gossip graphs
• Minimum multiple message broadcast graphs
• More broadcast graphs
• New gossips and telephones
• On the minimum path problem in Knödel graphs
• On the monotonicity of the broadcast function
• Optimal algorithms for dissemination of information in some interconnection networks
• Tight bound on the diameter of the Knödel graph
• Upper bounds on the broadcast function using minimum dominating sets

Cited in

(9)

• On broadcast schemes of Knödel graphs
• Tight bound on the diameter of the Knödel graph
• On the minimum path problem in Knödel graphs
• Some properties of the Knödel graph \(W(k,2^k)\), \(k\geq 4\)
• Diameter of General Knödel Graphs
• Total domination in cubic Knodel graphs
• A new construction of broadcast graphs
• Domination in 4-regular Knödel graphs
• scientific article; zbMATH DE number 1517139 (Why is no real title available?)

This page was built for publication: The shortest path problem in the Knödel graph

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