Premium
Enumeration of networks
Author(s) -
Thomson P. F.
Publication year - 1976
Publication title -
international journal for numerical methods in engineering
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.421
H-Index - 168
eISSN - 1097-0207
pISSN - 0029-5981
DOI - 10.1002/nme.1620100118
Subject(s) - mathematics , combinatorics , surface (topology) , enumeration , vertex (graph theory) , regular polygon , enhanced data rates for gsm evolution , cover (algebra) , plane (geometry) , geometry , topology (electrical circuits) , computer science , graph , mechanical engineering , telecommunications , engineering
The results of previous workers relating the number of internal and external vertices in a two‐dimensional network to the number of elements of one given geometry are generalized to cover elements of any geometry (not necessarily convex) and any number of edge nodes, which may be vertex nodses of adjacent elements. It is shown that a relationship between the number of elements and number of vertices (nodes) alone exists only on a surface (plane or otherwise) and therefore cannot be extended to three‐dimensional networks. In three‐dimensions, the number of elements with any number of edges and vertices is related to the number of internal and external edges and vertices, is related to the number of internal and external edges and vertices, enclosed by a surface which may be non‐simple, (i.e. of topological genus greater than zero).