4 citations · 4 across the 3 of their papers we have counts for
5 papers
On unimodular tournaments
Wiam Belkouche, Abderrahim Boussaïri, Abdelhak Chaïchaâ +1
A tournament is unimodular if the determinant of its skew-adjacency matrix is . In this paper, we give some properties and constructions of unimodular tournaments. A unimodular…
Generalized tournament matrices with the same principal minors
Abderrahim Boussaïri, Abdelhak Chaïchaâ, Brahim Chergui +1
A generalized tournament matrix is a nonnegative matrix that satisfies , where is the all ones matrix and is the identity matrix. In this paper, a characte…
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…
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…
An exact extremal result for tournaments and 4-uniform hypergraphs
Wiam Belkouche, Abderrahim Boussaïri, Soufiane Lakhlifi +1
In this paper, we address the following problem due to Frankl and Füredi (1984). What is the maximum number of hyperedges in an -uniform hypergraph with vertices, such that…