3 citations · 6 across the 6 of their papers we have counts for
8 papers
-tuple domination on Kneser graphs
María Gracia Cornet, Pablo Torres
This paper considers multiple domination on Kneser graphs. We focus on -tuple dominating sets, -packings and the associated graph parameters -tuple domination number and $…
On the diameter of Schrijver graphs
Agustina Victoria Ledezma, Adrián Pastine, Pablo Torres +1
For and , the well known Kneser graph has all -element subsets of an -element set as vertices; two such subsets are adjacent if…
Grundy dominating sequences on -join product
Graciela Nasini, Pablo Torres
In this paper we study the Grundy domination number on the -join product of a graph and a family of graphs . The…
Total dominating sequences in trees, split graphs, and under modular decomposition
Boštjan Brešar, Tim Kos, Graciela Nasini +1
A sequence of vertices in a graph with no isolated vertices is called a total dominating sequence if every vertex in the sequence totally dominates at least one vertex that was…
Shifts of the Stable Kneser Graphs and Hom-Idempotence
Pablo Torres, Mario Valencia-Pabon
A graph is said to be {\em hom-idempotent} if there is a homomorphism from to , and {\em weakly hom-idempotent} if for some there is a homomorphism from $G^…
On the Packing Chromatic Number on Hamming Graphs and General Graphs
Graciela Nasini, Daniel Severin, Pablo Torres
The packing chromatic number of a graph is the smallest integer needed to proper color the vertices of in such a way the distance between any two vertices havi…
The automorphism group of the -stable Kneser graphs
Pablo Torres
For , the -stable Kneser graphs are the graphs with vertex set the -subsets of such that the circular distance between any two elements in …
The Identifying Code problem on -tidy graphs
Graciela Nasini, Pablo Torres
In this paper we first analyze the behaviour of the identifying code number under union and join operations in graphs. This study forced us to analyze three new parameters related…