The use of eigenfunctions has been proposed to measure spatial structure in networks. So far, however, there has been a paucity of applications of the approach, particularly to cellular networks (mosaics). This study uses specially constructed cellular networks which possess very similar degree vectors but dissimilar arrangements of vertex degrees to test the effectiveness of the approach. The results of this test indicate that there are several considerable limitations inherent in the procedure.
Get full access to this article
View all access options for this article.
References
1.
CliffA DHaggettPOrdJ K, 1979“Graph theory and geography” in Applications of Graph Theory Eds WilsonR JBeinekeL W (Academic Press, London) pp 293–326
GatrellA C, 1977a“Complexity and redundancy in binary maps”Geographical Analysis929–41
7.
GatrellA C, 1977b“An introduction to spatial autocorrelation and its geographical applications” DP-2, Department of Geography, University of Salford, Salford, England
8.
GriffithD AJonesK G, 1980“Explorations in the relationship between spatial structure and spatial interaction”Environment and Planning A12187–201
9.
SchwenkA JWilsonR J, 1978“On the eigenvalues of a graph” in Selected Topics in Graph Theory Eds BeinekeL WWilsonR J (Academic Press, London) pp 307–336
10.
TinklerK J, 1971“A coefficient of association for binary data”Area131–35
11.
TinklerK J, 1972“The physical interpretation of eigenfunctions of dichotomous matrices”Transactions, Institute of British Geographers5517–46
12.
TinklerK J, 1977An Introduction to Graph Theoretical Methods in Geography (Geo-Abstracts, Norwich)
13.
TinklerK J, 1979“Graph theory”Progress in Human Geography385–116
14.
WellsA F, 1977Three-Dimensional Nets and Polyhedra (John Wiley, New York)
