C. Balbuena

activity

19942024

most citedFamilies of Small Regular Graphs of Girth 5

27 citations · 54 across the 14 of their papers we have counts for

collaborators

Showing 2019Show all

2 papers · 1 filter

math.CO2019

Identifying codes in line digraphs

C. Balbuena, C. Dalfó, B. Martínez-Barona

Given an integer $ℓ \geq 1$ , a $(1, \leq ℓ)$ -identifying code in a digraph is a dominating subset $C$ of vertices such that all distinct subsets of vertices of cardinality at mos…

math.CO2019★ 1 cited

Sufficient conditions for a digraph to admit a $(1, \leq ℓ)$ -identifying code

C. Balbuena, C. Dalfó, B. Martínez-Barona

A $(1, \leq ℓ)$ -identifying code in a digraph $D$ is a subset $C$ of vertices of $D$ such that all distinct subsets of vertices of cardinality at most $ℓ$ have different closed…

Identifying codes in line digraphs

Sufficient conditions for a digraph to admit a (1,≤ℓ)-identifying code

Sufficient conditions for a digraph to admit a $(1, \leq ℓ)$ -identifying code