We study a particular digraph dynamical system, the so called digraph diclique operator. Dicliques have frequently appeared in the literature the last years in connection with the construction and analysis of different types of networks, for instance biochemical, neural, ecological, sociological and computer networks among others. Let D=(V,A) be a reflexive digraph (or network). Consider X and Y (not necessarily disjoint) nonempty subsets of vertices (or nodes) of D. A disimplex K(X,Y) of D is the subdigraph of D with vertex set X ∪ Y and arc set {(x,y)∶ x ∈ X, y ∈ Y\} (when X ∩ Y ≠ ∅, loops are not considered). A disimplex K(X,Y) of D is called a diclique of $D$ if $K(X,Y)$ is not a proper subdigraph of any other disimplex of D. The diclique digraph $\overrightarrow {k}(D) of a digraph $D$ is the digraph whose vertex set is the set of all dicliques of $D$ and ( K(X,Y),K(X',Y'))$ is an arc of $\overrightarrow {k}(D) if and only if Y ∩ X' ≠ ∅. We say that a digraph $D$ is self-diclique if $\overrightarrow {k}(D)$ is isomorphic to D. In this paper, we provide a characterization of the self-diclique circulant digraphs and an infinite family of non-circulant self-diclique digraphs.