NDLTD Global ETD Search
  • Refine Query
  • Source
  • Publication year
  • to
  • Language
  • No language data
  • Tagged with
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • About
  • The Global ETD Search service is a free service for researchers to find electronic theses and dissertations. This service is provided by the Networked Digital Library of Theses and Dissertations.
    Our metadata is collected from universities around the world. If you manage a university/consortium/country archive and want to be added, details can be found on the NDLTD website.

Search results

Showing 1 to 1 of 1 (0.011 seconds)
1

An Isomorphism Theorem for Graphs

Culp, 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.
graph theory
isomorphism
weak homomorphism
hom(G H)
Lovász
strong product
cancellation property strong product
Physical Sciences and Mathematics

Page generated in 0.0136 seconds