4 citations · 11 across the 7 of their papers we have counts for
7 papers · 1 filter
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…
Characterization of -spectrally monomorphic Hermitian matrices
Kawtar Attas, Abderrahim Boussaïri, Imane Souktani
This paper solves the following problem about Hermitian matrices related to the theory of -structures:\emph{ }Let be a positive integer and be an integer with $k\in \{3,…
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…
3-uniform hypergraphs: modular decomposition and realization by tournaments
Abderrahim Boussaïri, Brahim Chergui, Pierre Ille +1
Let be a 3-uniform hypergraph. A tournament defined on is a realization of if the edges of are exactly the 3-element subsets of that induce 3-cyc…
Determination of the prime bound of a graph
Abderrahim Boussaïri, Pierre Ille
Given a graph , a subset of is a module of if for each , is adjacent to all the elements of or to none of them. For instance, …
The {-3}-reconstruction and the {-3}-self duality of tournaments
Mouna Achour, Youssef Boudabbous, Abderrahim Boussairi
Let T = (V,A) be a (finite) tournament and k be a non negative integer. For every subset X of V is associated the subtournament T[X] = (X,A\cap (X \timesX)) of T, induced by X. The…