- Tytuł:
- Distinguishing graphs by the number of homomorphisms
- Autorzy:
- Fisk, Steve
- Powiązania:
- https://bibliotekanauki.pl/articles/971917.pdf
- Data publikacji:
- 1995
- Wydawca:
- Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
- Tematy:
-
graph homomorphism
chromatic number - Opis:
-
A homomorphism from one graph to another is a map that sends vertices to vertices and edges to edges. We denote the number of homomorphisms from G to H by |G → H|. If is a collection of graphs, we say that distinguishes graphs G and H if there is some member X of such that |G → X | ≠ |H → X|. is a distinguishing family if it distinguishes all pairs of graphs.
We show that various collections of graphs are a distinguishing family. - Źródło:
-
Discussiones Mathematicae Graph Theory; 1995, 15, 1; 73-75
2083-5892 - Pojawia się w:
- Discussiones Mathematicae Graph Theory
- Dostawca treści:
- Biblioteka Nauki
Artykuł