Article contents
A Canonical Factorization for Graph Homomorphisms
Published online by Cambridge University Press: 20 November 2018
Extract
The graphs are undirected, without loops or multiple edges. The edge set E(X) of a graph X is a set of certain unordered pairs [x, y] of distinct elements of the vertex set V(X). For x ϵ V(X) we denote by E(x; X) the edges of X incident with x. A (homo)morphism ϕ : X ⟶ Y is a function from V(X) to V(Y) which preserves edges; thus it induces ϕ# : E(X) ⟶ E(Y) by ϕ# [x, x’] = [ϕx, ϕx’].
- Type
- Research Article
- Information
- Copyright
- Copyright © Canadian Mathematical Society 1977
References
- 4
- Cited by