Can some one calculate the independent number of the following graph:

Suppose the set $\mathfrak{A}=\{1,2,\dots,8\}$ and consider the vertex of graph is the set of all $A=(\{a,b,c\},\{d,e\})$ where $a,b,c,d,e\in \mathfrak{A}$ and distinct and between two vertex $B=(\{a,b,c\},\{d,e\})$ and $C=(\{f,g,h\},\{k,l\})$ is an edge if 
$B\cap C=\{a,b,c\}=\{f,g,h\}$ or $B\cap C=\{d,e\}=\{k,l\}$.

My question is what is the independent number of this graph?

Recall that the independent number of a graph is the maximal number of vertices with no edge between them.