With emphasis on some natural asymptotic enumeration questions, a study is made of various arithmetical semigroups associated with isomorphism classes of finite graphs, trees and polyhedra. a suitable "abstract prime number theorem" is derived, particularly as an aid to solving the counting questions stated.
展开▼
