Spelling suggestions: "subject:"home(G H)"" "subject:"homo(G H)""
1 |
An Isomorphism Theorem for GraphsCulp, Laura 01 December 2009 (has links)
In the 1970’s, L. Lovász proved that two graphs G and H are isomorphic if and only if for every graph X , the number of homomorphisms from X → G equals the number of homomorphisms from X → H . He used this result to deduce cancellation properties of the direct product of graphs. We develop a result analogous to Lovász’s theorem, but in the class of graphs without loops and with weak homomorphisms. We apply it prove a general cancellation property for the strong product of graphs.
|
Page generated in 0.0233 seconds