Strongly Projective Graphs
Keyword(s):
AbstractWe 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 × Ks admits, up to automorphisms of K, exactly s homomorphisms to K.
2010 ◽
Vol 02
(02)
◽
pp. 207-211
◽
Keyword(s):
Keyword(s):
1994 ◽
Vol 3
(4)
◽
pp. 545-555
◽
Keyword(s):
1972 ◽
Vol 24
(5)
◽
pp. 805-807
◽
Keyword(s):
Keyword(s):
2021 ◽
Vol 10
(4)
◽
pp. 2115-2129
2010 ◽
Vol 21
(03)
◽
pp. 311-319
◽
Keyword(s):