On the Hyperdeterminants of Steiner Distance Hypermatrices

• Published in: The Electronic journal of combinatorics Vol. 32; no. 2
• Main Author: Zheng, Ya-Nan
• Format: Journal Article
• Language: English
• Published: 23.05.2025

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...