On the hyperdeterminants of Steiner distance hypermatrices
The electronic journal of combinatorics, Tome 32 (2025) no. 2
Cet article a éte moissonné depuis la source The Electronic Journal of Combinatorics website

Voir la notice de l'article

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

Ya-Nan Zheng  1

1 College of Mathematics and Information Science, Henan Normal University
@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/}
}
TY  - JOUR
AU  - Ya-Nan Zheng
TI  - On the hyperdeterminants of Steiner distance hypermatrices
JO  - The electronic journal of combinatorics
PY  - 2025
VL  - 32
IS  - 2
UR  - http://geodesic.mathdoc.fr/articles/10.37236/13741/
DO  - 10.37236/13741
ID  - 10_37236_13741
ER  - 
%0 Journal Article
%A Ya-Nan Zheng
%T On the hyperdeterminants of Steiner distance hypermatrices
%J The electronic journal of combinatorics
%D 2025
%V 32
%N 2
%U http://geodesic.mathdoc.fr/articles/10.37236/13741/
%R 10.37236/13741
%F 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 :