DocumentCode
1105327
Title
R70-9 A Graph-Theoretic Model for Periodic Discrete Structures
Author
Lawler, E.L.
Issue
6
fYear
1970
fDate
6/1/1970 12:00:00 AM
Firstpage
563
Lastpage
563
Abstract
Wiring schemes which exploit the potential of modern integrated circuit technology are likely to exhibit a high degree of " periodicity," as well as various other attributes. The first contribution of this paper is to formulate a precise definition of periodicity in terms of a graph-theoretic model originated by Yoeli. Roughly speaking, an infinite graph is said to be periodic if it can be generated from a finite template which is moved (periodically) from point to point in the plane. This definition is interesting and useful, and generalizes nicely to infinite graphs in n-space.
Keywords
Algebra; Automata; Automatic control; Formal languages; Integrated circuit technology; Joining processes; Lattices; Periodic structures; Planar arrays; Wiring;
fLanguage
English
Journal_Title
Computers, IEEE Transactions on
Publisher
ieee
ISSN
0018-9340
Type
jour
DOI
10.1109/T-C.1970.222980
Filename
1671573
Link To Document