Back to Search
Start Over
Distinguishing graphs by their left and right homomorphism profiles
- Source :
- idUS. Depósito de Investigación de la Universidad de Sevilla, instname
- Publication Year :
- 2011
- Publisher :
- Elsevier BV, 2011.
-
Abstract
- We introduce a new property of graphs called ‘q-state Potts unique-ness’ and relate it to chromatic and Tutte uniqueness, and also to ‘chromatic–flow uniqueness’, recently studied by Duan, Wu and Yu. We establish for which edge-weighted graphs H homomor-phism functions from multigraphs G to H are specializations of the Tutte polynomial of G, in particular answering a question of Freed-man, Lovász and Schrijver. We also determine for which edge-weighted graphs H homomorphism functions from multigraphs G to H are specializations of the ‘edge elimination polynomial’ of Averbouch, Godlin and Makowsky and the ‘induced subgraph poly-nomial’ of Tittmann, Averbouch and Makowsky. Unifying the study of these and related problems is the notion of the left and right homomorphism profiles of a graph. Ministerio de Educación y Ciencia MTM2008-05866-C03-01 Junta de Andalucía FQM- 0164 Junta de Andalucía P06-FQM-01649
- Subjects :
- Discrete mathematics
Left and right
Mathematics::Combinatorics
Induced subgraph
Chromatic polynomial
Tutte theorem
Theoretical Computer Science
Combinatorics
Computational Theory and Mathematics
Computer Science::Discrete Mathematics
Discrete Mathematics and Combinatorics
Homomorphism
Graph homomorphism
Uniqueness
Geometry and Topology
Tutte polynomial
Mathematics
Subjects
Details
- ISSN :
- 01956698
- Volume :
- 32
- Issue :
- 7
- Database :
- OpenAIRE
- Journal :
- European Journal of Combinatorics
- Accession number :
- edsair.doi.dedup.....f3b495af1cd2b15395d21f4b8dac912a
- Full Text :
- https://doi.org/10.1016/j.ejc.2011.03.012