A hypergraph \(H\)  is called a linear hypergraph(see [1]}), if each pair of the edges of \(H\)  has at most one common vertex. In a hypergraph, two vertices \(x, y\)  are said to be adjacent if there is an edge \(e\)  that contains both of these vertices and write \(x\sim y\) . Two edges are said to be adjacent if their intersection is not empty. A vertex \(v\)  is said to be incident to an edge \(e\)  if \(v\in e\) . A path of length \(q\)  in a hypergraph \(H\)  is defined to be an alternating sequence of vertices and edges \(v_1,e_1,v_2,e_2,\cdots ,v_q,e_q,v_{q+1}\)  such that
