1 citations · 1 across the 2 of their papers we have counts for
4 papers
On the Spectra of Generalized Token Graphs of Stars
Cristina Dalfó, Miquel Àngel Fiol, Berenice Martínez-Barona +1
In the generalization of token graphs (or supertoken graphs), the vertices of a -token graph of a graph correspond to distinguishable or indistinguishable tokens placed…
Strong cliques in diamond-free graphs
Nina Chiarelli, Berenice Martínez Barona, Martin Milanič +2
A strong clique in a graph is a clique intersecting all inclusion-maximal stable sets. Strong cliques play an important role in the study of perfect graphs. We study strong cliques…
Identifying codes in line digraphs
C. Balbuena, C. Dalfó, B. Martínez-Barona
Given an integer , a -identifying code in a digraph is a dominating subset of vertices such that all distinct subsets of vertices of cardinality at mos…
Sufficient conditions for a digraph to admit a -identifying code
C. Balbuena, C. Dalfó, B. Martínez-Barona
A -identifying code in a digraph is a subset of vertices of such that all distinct subsets of vertices of cardinality at most have different closed…