2 citations · 5 across the 11 of their papers we have counts for
Showing math.COShow all
2 papers · 1 filter
math.CO2021
On the domination number of -constrained de Bruijn graphs
Tiziana Calamoneri, Angelo Monti, Blerina Sinaimeri
Motivated by the work on the domination number of directed de Bruijn graphs and some of its generalizations, in this paper we introduce a natural generalization of de Bruijn graphs…
math.CO2021★ 2 cited
On Generalizations of Pairwise Compatibility Graphs
Tiziana Calamoneri, Manuel Lafond, Angelo Monti +1
A graph is a pairwise compatibility graph (PCG) if there exists an edge-weighted tree and an interval , such that each leaf of the tree is a vertex of the graph, and there i…