6 citations · 15 across the 11 of their papers we have counts for
Showing math.COShow all
2 papers · 1 filter
math.CO2026
A note on the diameter of graphs of two-dimensional simplex codes
Artur Siemaszko
Let be the graph induced in the Grassmann graph by the -ary simplex codes of dimension 2. For , this graph is known to have diameter 3. We prove that the same di…
math.CO2015★ 4 cited
The Shortest Path Problem for the Distant Graph of the Projective Line Over the Ring of Integers
Andrzej Matraś, Artur Siemaszko
The distant graph of the projective line over the ring of integers is considered. The shortest path problem in this graph is solved by use of Klein…