4 citations · 5 across the 6 of their papers we have counts for
Showing 2019Show all
3 papers · 1 filter
math.CO2019
On the spectral reconstruction problem for digraphs
Edward Bankoussou-mabiala, Abderrahim Boussaïri, Abdelhak Chaïchaâ +2
The idiosyncratic polynomial of a graph with adjacency matrix is the characteristic polynomial of the matrix , where is the identity matrix and is th…
math.CO2019
The simplicity index of tournaments
Abderrahim Boussaïri, Soufiane Lakhlifi, Imane Talbaoui
An -tournament with vertex set is simple if there is no subset of such that and for every , either…
math.CO2019
Matricial characterization of tournaments with maximum number of diamonds
Wiam Belkouche, Abderrahim Boussaïri, Soufiane Lakhlifi +1
A diamond is a -tournament which consists of a vertex dominating or dominated by a -cycle. Assuming the existence of skew-conference matrices, we give a complete characteriza…