Answers are grounded in this paper and cite their sources.
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 <m:math xmlns:m="http://www.w3.org/1998/Math/MathML"> <m:mi>k</m:mi> </m:math> k -uniform hypergraphs. Furthermore, it is shown that the determinant of the distance matrix of <m:math xmlns:m="http://www.w3.org/1998/Math/MathML"> <m:mi>k</m:mi> </m:math> k -uniform hyperstar on <m:math xmlns:m="http://www.w3.org/1998/Math/MathML"> <m:mi>n</m:mi> </m:math> n vertices is <m:math xmlns:m="http://www.w3.org/1998/Math/MathML"> <m:msup> <m:mrow> <m:mrow> <m:mo>(</m:mo> <m:mrow> <m:mo>−</m:mo> <m:mn>1</m:mn> </m:mrow> <m:mo>)</m:mo> </m:mrow> </m:mrow> <m:mrow> <m:mi>n</m:mi> <m:mo>−</m:mo> <m:mn>1</m:mn> </m:mrow> </m:msup> <m:mrow> <m:mo>(</m:mo> <m:mrow> <m:mi>n</m:mi> <m:mo>−</m:mo> <m:mn>1</m:mn> </m:mrow> <m:mo>)</m:mo> </m:mrow> <m:msup> <m:mrow> <m:mi>k</m:mi> </m:mrow> <m:mrow> <m:mstyle displaystyle="false"> <m:mfrac> <m:mrow> <m:mi>n</m:mi> <m:mo>−</m:mo> <m:mi>k</m:mi> </m:mrow> <m:mrow> <m:mi>k</m:mi> <m:mo>−</m:mo> <m:mn>1</m:mn> </m:mrow> </m:mfrac> </m:mstyle> </m:mrow> </m:msup> </m:math> {(-1)}ⁿ⁻¹(n-1){k}n-k/k-1 . Later, the distance spectrum of <m:math xmlns:m="http://www.w3.org/1998/Math/MathML"> <m:mi>k</m:mi> </m:math> k -uniform hyperstar is obtained, which gives the explicit distance energy of <m:math xmlns:m="http://www.w3.org/1998/Math/MathML"> <m:mi>k</m:mi> </m:math> k -uniform hyperstar.
No takes yet. Share an insight, caveat, or question.
Sharma et al. (2023) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: