F. Moazami

activity

20102014

most citedSecure Frameproof Code Through Biclique Cover

2 citations · 3 across the 5 of their papers we have counts for

collaborators

5 papers

math.CO2014

A Generalization of Cover Free Families

Mehdi Azadi Motlagh, Farokhlagha Moazami

An (r;w; d) -cover-free family (CFF) is a family of subsets of a finite set such that the intersection of any r members of the family contains at least d elements that are not in t…

math.CO2013

On the Biclique cover of the complete graph

Farokhlagha Moazami, Nasrin Soltankhah

Let $K$ be a set of $k$ positive integers. A biclique cover of type $K$ of a graph $G$ is a collection of complete bipartite subgraphs of $G$ such that for every edge $e$ of $G$ , t…

math.CO2012★ 1 cited

A Note on d-Biclique Covers

Farokhlagha Moazami, Nasrin Soltankhah, Shahzad Basiriz

A d-biclique cover of a graph G is a collection of bicliques of G such that each edge of G is in at least d of the bicliques. The number of bicliques in a minimum d-biclique cover…

math.CO2012★ 2 cited

Secure Frameproof Code Through Biclique Cover

Hossein Hajiabolhassan, Farokhlagha Moazami

For a binary code $Γ$ of length $v$ , a $v$ -word $w$ produces by a set of codewords ${w^{1}, ..., w^{r}} \subseteq Γ$ if for all $i = 1, ..., v$ , we have $w_{i} \in {w_{i}^{1}, ..., w_{i}^{r}}$ . We…

math.CO2010

Some New Bounds For Cover-Free Families Through Biclique Cover

Hossein Hajiabolhassan, Farokhlagha Moazami

An $(r, w; d)$ cover-free family $(C F F)$ is a family of subsets of a finite set such that the intersection of any $r$ members of the family contains at least $d$ elements that are no…