Minimal steiner trees for 2k × 2k square lattices

M. Brazil; T. Cole; J. H. Rubinstein; D. A. Thomas; J. F. Weng; N. C. Wormald

doi:10.1006/jcta.1996.0004

Minimal steiner trees for 2^k × 2^k square lattices

M. Brazil, T. Cole, J. H. Rubinstein, D. A. Thomas, J. F. Weng, N. C. Wormald

Research output: Contribution to journal › Article › Research › peer-review

8 Citations (Scopus)

Abstract

We prove a conjecture of Chung, Graham, and Gardner (Math. Mag. 62 (1989), 83-96), giving the form of the minimal Steiner trees for the set of points comprising the vertices of a 2^k × 2^k square lattice. Each full component of these minimal trees is the minimal Steiner tree for the four vertices of a square.

Original language	English
Pages (from-to)	91-110
Number of pages	20
Journal	Journal of Combinatorial Theory. Series A
Volume	73
Issue number	1
DOIs	https://doi.org/10.1006/jcta.1996.0004
Publication status	Published - 1996
Externally published	Yes

Access to Document

10.1006/jcta.1996.0004

Cite this

@article{3b5e540b1edb466c8c4d6a72d84a47c7,

title = "Minimal steiner trees for 2k × 2k square lattices",

abstract = "We prove a conjecture of Chung, Graham, and Gardner (Math. Mag. 62 (1989), 83-96), giving the form of the minimal Steiner trees for the set of points comprising the vertices of a 2k × 2k square lattice. Each full component of these minimal trees is the minimal Steiner tree for the four vertices of a square.",

author = "M. Brazil and T. Cole and Rubinstein, \{J. H.\} and Thomas, \{D. A.\} and Weng, \{J. F.\} and Wormald, \{N. C.\}",

year = "1996",

doi = "10.1006/jcta.1996.0004",

language = "English",

volume = "73",

pages = "91--110",

journal = "Journal of Combinatorial Theory. Series A",

issn = "0097-3165",

publisher = "Elsevier",

number = "1",

}

TY - JOUR

T1 - Minimal steiner trees for 2k × 2k square lattices

AU - Brazil, M.

AU - Cole, T.

AU - Rubinstein, J. H.

AU - Thomas, D. A.

AU - Weng, J. F.

AU - Wormald, N. C.

PY - 1996

Y1 - 1996

N2 - We prove a conjecture of Chung, Graham, and Gardner (Math. Mag. 62 (1989), 83-96), giving the form of the minimal Steiner trees for the set of points comprising the vertices of a 2k × 2k square lattice. Each full component of these minimal trees is the minimal Steiner tree for the four vertices of a square.

AB - We prove a conjecture of Chung, Graham, and Gardner (Math. Mag. 62 (1989), 83-96), giving the form of the minimal Steiner trees for the set of points comprising the vertices of a 2k × 2k square lattice. Each full component of these minimal trees is the minimal Steiner tree for the four vertices of a square.

UR - https://www.scopus.com/pages/publications/16144366554

U2 - 10.1006/jcta.1996.0004

DO - 10.1006/jcta.1996.0004

M3 - Article

AN - SCOPUS:16144366554

SN - 0097-3165

VL - 73

SP - 91

EP - 110

JO - Journal of Combinatorial Theory. Series A

JF - Journal of Combinatorial Theory. Series A

IS - 1

ER -

Minimal steiner trees for 2k × 2k square lattices

Abstract

Access to Document

Other files and links

Cite this

Minimal steiner trees for 2^k × 2^k square lattices