The shortest path problem in the Knödel graph
From MaRDI portal
Publication:2018539
DOI10.1016/j.jda.2014.11.008zbMath1325.05063OpenAlexW2026304802MaRDI QIDQ2018539
Hovhannes A. Harutyunyan, Hayk A. 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
Extremal problems in graph theory (05C35) Paths and cycles (05C38) Distance in graphs (05C12) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (5)
Unnamed Item ⋮ A new construction of broadcast graphs ⋮ Diameter of General Knödel Graphs ⋮ Domination in 4-regular Knödel graphs ⋮ Total domination in cubic Knodel graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Upper bounds on the broadcast function using minimum dominating sets
- New gossips and telephones
- Minimum broadcast graphs
- Optimal algorithms for dissemination of information in some interconnection networks
- 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
- Minimum linear gossip graphs and maximal linear (?,k)-gossip graphs
- Tight Bound on the Diameter of the Knödel Graph
- An Efficient Vertex Addition Method for Broadcast Networks
- On the minimum path problem in Knödel graphs
- 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
This page was built for publication: The shortest path problem in the Knödel graph
