activity
20112023
most citedOn Perfect and Quasiperfect Domination in Graphs

2 citations · 3 across the 5 of their papers we have counts for

collaborators

6 papers

math.CO2023

Metric Location in Pseudotrees: A survey and new results

José Cáceres, Ignacio M. Pelayo

The aim of this paper is to revise the literature on different metric locations in the families of paths, cycles, trees and unicyclic graphs, as well as, provide several new result…

math.CO2017

Dominating 2-broadcast in graphs: complexity, bounds and extremal graphs

José Cáceres, Carmen Hernando, Mercè Mora +2

Limited dominating broadcasts were proposed as a variant of dominating broadcasts, where the broadcast function is upper bounded. As a natural extension of domination, we consider…

math.CO2016

Quasi-efficient domination in grids

Sahar A. Aleid, José Cáceres, María Luz Puertas

Domination of grids has been proved to be a demanding task and with the addition of independence it becomes more challenging. It is known that no grid with has an effi…

math.CO2014★ 2 cited

On Perfect and Quasiperfect Domination in Graphs

José Cáceres, Carmen Hernando, Mercè Mora +2

A subset in a graph is a -quasiperfect dominating set (for ) if every vertex not in is adjacent to at least one and at most vertices in…

math.CO2013★ 1 cited

On the boundary as an -geodominating set in graphs

J. Cáceres, M. Morales, M. L. Puertas

Given a graph and a vertex , a vertex set is an -geodominating set of if each vertex lies on an geodesic for some element…

math.CO2011

m_3^3-Convex geometries are A-free

J. Cáceres, O. R. Oellermann, M. L. Puertas

Let V be a finite set and M a collection of subsets of V. Then M is an alignment of V if and only if M is closed under taking intersections and contains both V and the empty set. I…