The last decade witnessed a revolution in hypergraph theory when different tensors or hypermatrices associated with hypergraphs are studied extensively in [1]}, [2]} and references therein. Despite promising progress, some aspects of spectral graph theory cannot be generalised to spectral hypergraph theory using tensors. The high computational complexity of the tensors associated with hypergraphs is another challenge in studying many spectral aspects of hypergraphs. Most tensor-related problems are NP-hard, as shown in [3]}. The alternative method for studying a hypergraph is to examine the underlying graph with appropriate weights. Different properties of a hypergraph are studied in terms of the spectra of different connectivity matrices associated with the underlying weighted graph of the hypergraph, see [4]}, [5]}, [6]}, [7]}. Since many significant properties (including the connectivity among the vertices) of a hypergraph are encrypted in the spectra of these matrices, they are generally referred to as the connectivity matrices of the hypergraphs.
