Article contents
Strongly Projective Graphs
Published online by Cambridge University Press: 20 November 2018
Abstract
We introduce the notion of strongly projective graph, and characterise these graphs in terms of their neighbourhood poset. We describe certain exponential graphs associated to complete graphs and odd cycles. We extend and generalise a result of Greenwell and Lovász [6]: if a connected graph $G$ does not admit a homomorphism to $K$, where $K$ is an odd cycle or a complete graph on at least 3 vertices, then the graph $G\,\times \,{{K}^{S}}$ admits, up to automorphisms of $K$, exactly $s$ homomorphisms to $K$.
- Type
- Research Article
- Information
- Copyright
- Copyright © Canadian Mathematical Society 2002
References
- 1
- Cited by