Distance-Uniform Graphs with Large Diameter

DOI10.1137/17M115791XzbMath1419.05063arXiv1703.01477OpenAlexW2963664551WikidataQ127655594 ScholiaQ127655594MaRDI QIDQ5232139

Mikhail Lavrov, Arnau Messegué, Po-Shen Loh

Publication date: 29 August 2019

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

equilibriumdiameterextremal combinatoricsTower of Hanoinetwork creation

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Deterministic network models in operations research (90B10) Distance in graphs (05C12)

Related Items (1)

On the PoA Conjecture: Trees versus Biconnected Components

Cites Work

• Unnamed Item
• The price of anarchy in network creation games is (mostly) constant
• Shortest paths between regular states of the Tower of Hanoi
• The max-distance network creation game on general host graphs
• Correction: Basic Network Creation Games
• Tree Nash Equilibria in the Network Creation Game
• On a network creation game
• The price of anarchy in network creation games
• On the Tree Conjecture for the Network Creation Game
• On nash equilibria for a network creation game
• The Diameter of Random Graphs
• A Bounded Budget Network Creation Game

This page was built for publication: Distance-Uniform Graphs with Large Diameter