Affiliation:
1. Department of Mathematics, IIT Kharagpur , Kharagpur-721302 , India
Abstract
Abstract
In this article, we extend the concept of distance energy for hypergraphs. We first establish a relation between the distance energy and the distance spectral radius. Then, we obtain some bounds for the distance energy in terms of some invariant of hypergraphs such as the determinant of the distance matrix, number of vertices, and Wiener index along with the distance energy of join of
k
k
-uniform hypergraphs. Furthermore, it is shown that the determinant of the distance matrix of
k
k
-uniform hyperstar on
n
n
vertices is
(
−
1
)
n
−
1
(
n
−
1
)
k
n
−
k
k
−
1
{\left(-1)}^{n-1}\left(n-1){k}^{\tfrac{n-k}{k-1}}
. Later, the distance spectrum of
k
k
-uniform hyperstar is obtained, which gives the explicit distance energy of
k
k
-uniform hyperstar.
Subject
Geometry and Topology,Algebra and Number Theory
Reference17 articles.
1. M. Aouchiche and P. Hansen, Distance spectra of graphs: A survey, Linear Algebra Appl. 458 (2014), 301–386.
2. R. B. Bapat, R. Jana, and S. Pati, The bipartite distance matrix of a non-singular tree, Linear Algebra Appl. 631 (2021), 254–281.
3. R. B. Bapat, A. K. Lal, and S. Pati, A q-analogue of the distance matrix of a tree, Linear Algebra Appl. 416 (2006), 799–814.
4. A. Cayley, A theorem in the geometry of position, Cambridge Math. J. 2 (1841), 267–271.
5. B. Claude, Graphs and Hypergraphs, North-Holland Publishing Company, North-Holland, 1973.