9 citations · 10 across the 3 of their papers we have counts for
3 papers
math.CO2009
SQS-graphs of Solov'eva-Phelps codes
Italo J. Dejter
A binary extended 1-perfect code folds over its kernel via the Steiner quadruple systems associated with its codewords. The resulting folding, proposed as a graph inva…
math.CO2009★ 1 cited
Quasiperfect domination in triangular lattices
Italo J. Dejter
A vertex subset of a graph is a perfect (resp. quasiperfect) dominating set in if each vertex of is adjacent to only one vertex ( vert…
math.CO2007★ 9 cited
On a {K_4,K_{2,2,2}}-ultrahomogeneous graph
Italo J. Dejter
The existence of a connected 12-regular -ultrahomogeneous graph is established, (i.e. each isomorphism between two copies of or in exte…