On the hyperdeterminants of Steiner distance hypermatrices
The electronic journal of combinatorics, Tome 32 (2025) no. 2
Let $G$ be a graph on $n$ vertices. The Steiner distance of a collection of $k$ vertices in $G$ is the fewest number of edges in any connected subgraph containing those vertices. The order $k$ Steiner distance hypermatrix of $G$ is the $n$-dimensional array indexed by vertices, whose entries are the Steiner distances of their corresponding indices. In this paper, we confirm a conjecture on the Steiner distance hypermatrices proposed by Cooper and Du [Electron. J. Combin. 31(3):\#P3.4, 2024]. Furthermore, we also compute the hyperdeterminant of the order $k$ Steiner distance hypermatrix of $P_{3}$.
DOI :
10.37236/13741
Classification :
05C12, 05C31, 15A69
Mots-clés : characteristic polynomial
Mots-clés : characteristic polynomial
Affiliations des auteurs :
Ya-Nan Zheng  1
@article{10_37236_13741,
author = {Ya-Nan Zheng},
title = {On the hyperdeterminants of {Steiner} distance hypermatrices},
journal = {The electronic journal of combinatorics},
year = {2025},
volume = {32},
number = {2},
doi = {10.37236/13741},
zbl = {1565.05026},
url = {http://geodesic.mathdoc.fr/articles/10.37236/13741/}
}
Ya-Nan Zheng. On the hyperdeterminants of Steiner distance hypermatrices. The electronic journal of combinatorics, Tome 32 (2025) no. 2. doi: 10.37236/13741
Cité par Sources :