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 …
and beyond: A survey of the degree/diameter problem Mirka Miller School of Mathematical …
[HTML][HTML] Asymptotically large (Δ, D)-graphs
EA Canale, J Gómez - Discrete applied mathematics, 2005 - Elsevier
Asymptotically large (Δ,D)-graphs - ScienceDirect Skip to main contentSkip to article Elsevier
logo Journals & Books Search RegisterSign in View PDF Download full issue Search …
logo Journals & Books Search RegisterSign in View PDF Download full issue Search …
Unilaterally connected large digraphs and generalized cycles
Lower and upper bounds on the order of digraphs and generalized p‐cycles with a specified
maximum degree and unilateral diameter are given for generic values of the parameters …
maximum degree and unilateral diameter are given for generic values of the parameters …
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 …
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
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) …
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 …
problemes i per al cas de digrafs de doble pas. Un digraf és una xarxa constituïda per …