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 …
Power graphs: a survey
Power Graphs: A Survey Page 1 www.ejgta.org Electronic Journal of Graph Theory and
Applications 1 (2) (2013), 125–147 Power Graphs: A Survey Jemal Abawajya, Andrei …
Applications 1 (2) (2013), 125–147 Power Graphs: A Survey Jemal Abawajya, Andrei …
Greedy routing in circulant networks
H Pérez-Rosés, M Bras-Amorós… - Graphs and …, 2022 - Springer
We address the problem of constructing large circulant networks with given degree and
diameter, and efficient routing schemes. First we discuss the theoretical upper bounds and …
diameter, and efficient routing schemes. First we discuss the theoretical upper bounds and …
[PDF][PDF] Algebraic and computer-based methods in the undirected degree= diameter problem–a brief survey
H Pérez Rosés - 2014 - repositori.udl.cat
Algebraic and computer-based methods in the undirected degree/diameter problem – A brief
survey Page 1 www.ejgta.org Electronic Journal of Graph Theory and Applications 2 (2) …
survey Page 1 www.ejgta.org Electronic Journal of Graph Theory and Applications 2 (2) …
[图书][B] Automorphism Groups of Maps, Surfaces and Smarandache Geometries (partially post-doctoral research for the Chinese Academy of Sciences, Beijing)
L Mao - 2005 - books.google.com
A combinatorial map is a connected topological graph cellularly embedded in a surface.
This monograph concentrates on the automorphism group of a map, which is related to the …
This monograph concentrates on the automorphism group of a map, which is related to the …
A note on the McKay–Miller–Širáň graphs
J Šiagiová - Journal of Combinatorial Theory, Series B, 2001 - Elsevier
McKay, Miller, and Širáň (1998, J. Combin. Theory Ser. B74 (1), 110–118) constructed a
family of the currently largest known vertex-transitive graphs of degree d, diameter 2, and …
family of the currently largest known vertex-transitive graphs of degree d, diameter 2, and …
[PDF][PDF] New record graphs in the degree-diameter problem
E Loz, J Sirán - Australasian Journal of Combinatorics, 2008 - researchgate.net
Abstract In 1994, Dinneen and Hafner (Networks 24 No. 7, 359–367) published a table of
largest orders of graphs of given degree up to 15 and diameter up to 10, known to that date …
largest orders of graphs of given degree up to 15 and diameter up to 10, known to that date …
Distance labellings of Cayley graphs of semigroups
A Kelarev, C Ras, S Zhou - Semigroup Forum, 2015 - Springer
This paper establishes connections between the structure of a semigroup and the minimum
spans of distance labellings of its Cayley graphs. We show that certain general restrictions …
spans of distance labellings of its Cayley graphs. We show that certain general restrictions …
[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 …
LDPC codes from voltage graphs
CA Kelley, JL Walker - 2008 IEEE International Symposium on …, 2008 - ieeexplore.ieee.org
Several well-known structure-based constructions of LDPC codes, for example codes based
on permutation and circulant matrices and in particular, quasi-cyclic LDPC codes, can be …
on permutation and circulant matrices and in particular, quasi-cyclic LDPC codes, can be …