Symmetrization theorem of full Steiner trees (Q1328395): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: On the Efficiency of the Algorithm for Steiner Minimal Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5341359 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Steiner Minimal Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Problem of Steiner / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some remarks on the Steiner problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A variational approach to the Steiner network problem / rank
 
Normal rank

Latest revision as of 16:47, 22 May 2024

scientific article
Language Label Description Also known as
English
Symmetrization theorem of full Steiner trees
scientific article

    Statements

    Symmetrization theorem of full Steiner trees (English)
    0 references
    0 references
    20 March 1995
    0 references
    The paper contributes to the plane Steiner problem by a symmetrization theorem. The topology of a full Steiner tree with an even number of regular points (and of Steiner points) is called symmetric iff there is a fixpoint-free 1-1 correspondence of all points preserving adjacency and preserving the circular ordering of the neighbors of each Steiner point. It is shown that to each full Steiner tree on \(2n\) (regular) points with symmetric topology there exists a full Steiner tree on a central symmetric set of \(2n\) points having the same length. This result is used to give a short proof for a result of \textit{H. O. Pollak} on quadrilaterals, see [J. Comb. Theory, Ser. A 24, 278-295 (1978; Zbl 0392.05021)].
    0 references
    Steiner tree
    0 references
    Steiner points
    0 references
    0 references

    Identifiers