In spectral graph theory, the properties of graphs are investigated by the eigenvalues of various associated matrices, such as adjacency matrix, Laplacian matrix, signless Laplacian matrix, normalized Laplacian matrix etc; see, [1]}. Likewise, in spectral hypergraph theory, spectra of different connectivity tensors and matrices associated to hypergraphs were studied in the literature; see, [2]}, [3]}, [4]}, [5]}, [6]}, [7]}, [8]}. Recently, Anirban Banerjee [3]} introduced some connectivity matrices namely, the adjacency matrix, the Laplacian matrix and the normalized Laplacian matrix for unweighted hypergraphs.
Therein, some of the properties of hypergraphs were studied using the spectrum of these associated matrices. Subsequently, Amitesh Sarkar and Anirban Banerjee [10]} extend the definiton of the adjacency matrix of a hypergraph introduced in [3]} to a weighted hypergraph.
In the rest of this paper, we consider the matrix representation of hypergraphs defined in [10]}.
