Jump to content

Core (graph theory)

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Robert Samal (talk | contribs) at 05:19, 7 March 2007 (Created page with 'In the mathematical field of graph theory, a '''core''' is a notion that describes behavious of a graph with respect to ...'). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.
(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)

In the mathematical field of graph theory, a core is a notion that describes behavious of a graph with respect to graph homomorphisms. More precisely:

  • A graph is a core if every homomorphism
 is a isomorphism.
  • A core of a graph is a graph such that