Moore graphs and beyond: A survey of the degree/diameter problem

M Miller, J Sirán - The electronic journal of combinatorics, 2012 - combinatorics.org
Moore graphs and beyond: A survey of the degree/diameter problem Page 1 Moore graphs
and beyond: A survey of the degree/diameter problem Mirka Miller School of Mathematical …

Double Oracle Algorithm for Game-Theoretic Robot Allocation on Graphs

Z An, L Zhou - arXiv preprint arXiv:2312.11791, 2023 - arxiv.org
We study the problem of game-theoretic robot allocation where two players strategically
allocate robots to compete for multiple sites of interest. Robots possess offensive or …

The Manhattan product of digraphs

FP Comellas Padró, C Dalfó Simó… - Electronic Journal of …, 2013 - upcommons.upc.edu
We study the main properties of a new product of bipartite digraphs which we call Manhattan
product. This product allows us to understand the subjacent product in the Manhattan street …

The (Delta, D) and (Delta, N) problems in double-step digraphs with unilateral distance

C Dalfo, MÀ Fiol - Electronic Journal of Graph Theory and Applications …, 2014 - ejgta.org
The (∆,D) and (∆,N) problems in double-step digraphs with unilateral distance Page 1 www.ejgta.org
Electronic Journal of Graph Theory and Applications 2 (1) (2014), 1–17 The (∆,D) and (∆,N) …

Diàmetre unilateral en digrafs de doble pas

M Gomis Garcia - 2012 - upcommons.upc.edu
En termes generals, l'objectiu d'aquest treball és estudiar el diàmetre unilateral en els
problemes i per al cas de digrafs de doble pas. Un digraf és una xarxa constituïda per …