University of Puerto Rico at Río Piedras

output

19922025

most citedThe Arecibo Legacy Fast ALFA Survey: I. Science Goals, Survey Design and Strategy

830 citations

researchers with a paper here

Counting papers with at most 25 authors, so collaboration author lists do not stand in for the people here.

collaborating institutions

Showing 2007 · math.COShow all

4 papers · 2 filters

math.CO2007★ 28 cited

Perfect domination in rectangular grid graphs

Italo J. Dejter, Abel A. Delgado

A dominating set $S$ in a graph $G$ is said to be perfect if every vertex of $G$ not in $S$ is adjacent to just one vertex of $S$ . Given a vertex subset $S^{'}$ of a side $P_{m}$ of an…

math.CO2007★ 5 cited

Perfect domination in regular grid graphs

Italo J. Dejter

We show there is an uncountable number of parallel total perfect codes in the integer lattice graph $Λ$ of $R^{2}$ . In contrast, there is just one 1-perfect code in $Λ$ and one tota…

math.CO2007

Homogeneous edge-disjoint $K_{2 s}$ and $T_{s t, t}$ unions

Italo J. Dejter

Let $r > 2$ and $σ \in (0, r - 1)$ be integers. We require $t < 2 s$ , where $t = 2^{σ + 1} - 1$ and $s = 2^{r - σ - 1}$ . Generalizing a known ${K_{4}, T_{6, 3}}$ -ultrahomogenous graph $G_{3}^{1}$ , we find tha…

math.CO2007★ 9 cited

On a {K_4,K_{2,2,2}}-ultrahomogeneous graph

Italo J. Dejter

The existence of a connected 12-regular ${K_{4}, K_{2, 2, 2}}$ -ultrahomogeneous graph $G$ is established, (i.e. each isomorphism between two copies of $K_{4}$ or $K_{2, 2, 2}$ in $G$ exte…

Perfect domination in rectangular grid graphs

Perfect domination in regular grid graphs

Homogeneous edge-disjoint K2s​ and Tst,t​ unions

On a {K_4,K_{2,2,2}}-ultrahomogeneous graph

Homogeneous edge-disjoint $K_{2 s}$ and $T_{s t, t}$ unions