Results 11 to 20 of about 1,735,900 (276)
Steiner distance stable graphs [PDF]
Discrete Mathematics, 1994 Let G be a connected graph and S a nonempty set of vertices of G. Then the Steiner distance dG(S) of S is the smallest number of edges in a connected subgraph of G that contains S. Let k,l,s and m be nonnegative integers with m⩾s⩾2 and k and l not both 0.
Goddard, Wayne +5 more
core +4 more sources
Steiner distance and convexity in graphs [PDF]
European Journal of Combinatorics, 2008 We use the Steiner distance to define a convexity in the vertex set of a graph, which has a nice behavior in the well-known class of HHD-free graphs. For this graph class, we prove that any Steiner tree of a vertex set is included into the geodesical ...
Cáceres, J. +2 more
core +8 more sources
Steiner intervals and Steiner geodetic numbers in distance-hereditary graphs [PDF]
Discrete Mathematics, 2007 A Steiner tree for a set S of vertices in a connected graph G is a connected subgraph of G with a smallest number of edges that contains S. The Steiner interval I(S) of S is the union of all the vertices of G that belong to some Steiner tree for S. If S={
Puertas, María Luz +1 more
core +3 more sources
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.
G.Priscilla Pacifica, J.Jenit Ajitha
core +2 more sources
Steiner distance in chemical graph theory [PDF]
, 2021 Steiner distance dG(S) is a natural generalization of the concept of distance in a graph. For a connected graph G of order at least 2 and S ⊆ V (G), dG(S) is equal to the minimum size among all connected subgraphs whose vertex sets are equal to the ...
Mao, Yaping, Furtula, Boris
core +3 more sources
Steiner distances in generalized corona products
Analele Stiintifice ale Universitatii Ovidius Constanta: Seria MatematicaThe Steiner distance of a subset of vertices in a graph is the minimum size among all the connected subgraphs containing this subset. This paper focuses on the study of Steiner distances in both generalized vertex corona (GVC) and generalized edge corona
Gurusamy R. +3 more
doaj +2 more sources
Neuron‐Inspired Steiner Tree Networks for 3D Low‐Density Metastructures
Advanced Science, 2021 Three‐dimensional (3D) micro‐and nanostructures have played an important role in topological photonics, microfluidics, acoustic, and mechanical engineering.
Haoyi Yu +7 more
doaj +1 more source
Steiner symmetrals and their distance from a ball [PDF]
Israel Journal of Mathematics, 2003 For \(\varepsilon> 0\), let \(N(n,\varepsilon)\) be the minimum number of successive Steiner symmetrizations sufficient to transform any convex body in \(\mathbb{R}^n\), with volume equal to the volume of the unit ball \(B^n\), into a convex body whose Hausdorff distance from \(B^n\) is at most \(\varepsilon\).
BIANCHI, GABRIELE, GRONCHI, PAOLO
openaire +4 more sources
Comparison between Steiner cephalometric and modified Andrews photometric method for assessing antero-posterior position of the maxillary central incisors. [PDF]
Srpski Arhiv za Celokupno Lekarstvo, 2019 Introduction/Objective. Maxillary incisors, when exposed during smile, are one of the most important facial features. In an attempt to overcome limitations of standard cephalometric methods, Andrews described an approach to determine ideal ...
Vučinić Predrag +3 more
doaj +1 more source
The Steiner tree problem on graphs: inapproximability results [PDF]
, 2008 The Steiner tree problem on weighted graphs seeks a minimum weight subtree containing a given subset of the vertices (terminals). We show that it is NP-hard to approximate the Steiner tree problem within a factor 96/95.
Chlebikova, Janka +4 more
core +1 more source