Results 11 to 20 of about 8,370 (109)
Steiner μ Distance in Fuzzy Graphs with Application
International Journal of Engineering and Advanced Technology, 2020 In this article we define Steiner and upper Steiner distances in connected fuzzy graphs by combining the notion of Steiner distance with distance and proved that both are metric. Also based on length, eccentricity, radius, diameter, diametric vertex, eccentric vertex, centre, convexity, self-centred graphs are introduced for both Steiner and upper ...
G.Priscilla Pacifica, J.Jenit Ajitha
openaire +1 more source
Graph Spanners for Group Steiner Distances
CoRRA spanner is a sparse subgraph of a given graph $G$ which preserves distances, measured w.r.t.\ some distance metric, up to a multiplicative stretch factor. This paper addresses the problem of constructing graph spanners w.r.t.\ the group Steiner metric, which generalizes the recently introduced beer distance metric.
Davide Bilo' +3 more
openaire +4 more sources
Note on the Spectra of Steiner Distance Hypermatrices
The Electronic Journal of CombinatoricsThe Steiner distance of a set of vertices in a graph is the fewest number of edges in any connected subgraph containing those vertices. The order-$k$ Steiner distance hypermatrix of an $n$-vertex graph is the $n \times \cdots \times n$ ($k$ terms) array indexed by vertices, whose entries are the Steiner distances of their corresponding indices.
Joshua Cooper 0002, Zhibin Du
openaire +3 more sources
On the Hyperdeterminants of Steiner Distance Hypermatrices
The Electronic Journal of CombinatoricsLet $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.
openaire +1 more source
The Steiner distance problem for large vertex subsets in the hypercube [PDF]
Bull. ICA, 2019 We find the asymptotic behavior of the Steiner k-diameter of the $n$-cube if $k$ is large. Our main contribution is the lower bound, which utilizes the probabilistic method.
Éva Czabarka +2 more
openaire +2 more sources
Maximal Steiner Trees in the Stochastic Mean-Field Model of Distance [PDF]
Combinatorics, Probability and Computing, 2017 Consider the complete graph on n vertices, with edge weights drawn independently from the exponential distribution with unit mean. Janson showed that the typical distance between two vertices scales as log n/n, whereas the diameter (maximum distance between any two vertices) scales as 3 log n/n.
A. Davidson, Ayalvadi Ganesh 0001
openaire +4 more sources
Distance and fractional isomorphism in Steiner triple systems [PDF]
Rendiconti del Circolo Matematico di Palermo, 2007 The distance between two Steiner triple systems of the same order is the minimum volume of a trade that transforms one system into an isomorphic copy of the other. Distances among all Steiner triple systems of order 15 are reported here. One can require in addition that the trade consist of two isomorphic configurations, in which case there exist pairs
Forbes, A. D. +2 more
openaire +2 more sources
Determinants of Steiner Distance Hypermatrices
Generalizing work from the 1970s on the determinants of distance hypermatrices of trees, we consider the hyperdeterminants of order-$k$ Steiner distance hypermatrices of trees on $n$ vertices. We show that they can be nearly diagonalized as $k$-forms, generalizing a result of Graham-Lovász, implying a tensor version of ``conditional negative ...
Cooper, Joshua, Du, Zhibin
openaire +2 more sources
Steiner distance in graphs [PDF]
Časopis pro pěstování matematiky, 1989 Gary Chartrand +3 more
openaire +1 more source