Minimal steiner trees on square lattices
Date of Publication
1992
Document Type
Bachelor's Thesis
Degree Name
Bachelor of Science in Mathematics
College
College of Science
Department/Unit
Mathematics and Statistics
Abstract/Summary
The paper gives a general approach in constructing minimal trees using Steiner points. Steiner points are the points added in a given set of points, used to minimize the length of the network connecting the original set of points. Such a network is called a Steiner tree. A square lattice is a set of points arranged in the form of a square. The conjectured minimal Steiner trees for square lattice of orders 2 to 14 are presented here. To construct minimal Steiner trees for square lattices of orders bigger than 14, a core square with a folded band of width 3 is used.The formulas, illustrations and theorems discussed in the thesis came from the articles, Steiner Trees on a Checkerboard by Fan Chung, Martin Gardner and Ron Graham, and Steiner minimal Trees by E. N. Gilbert and H. O. Pollack.
Abstract Format
html
Language
English
Format
Accession Number
TU05864
Shelf Location
Archives, The Learning Commons, 12F, Henry Sy Sr. Hall
Physical Description
53 numb. leaves
Keywords
Trees (Graph theory); Square; Lattice theory; Graph theory
Recommended Citation
Santiago, M. S., & Ventura, R. P. (1992). Minimal steiner trees on square lattices. Retrieved from https://animorepository.dlsu.edu.ph/etd_bachelors/16028
