For any graph H, the function h,. defined by setting h,(G) equal to the number of homomorphisms from G into H, is a multiplicative increasing function. L.ov&sz [2] has asked whether ail nonzero multiplicative increasing functions are generated by functions of this type. We show that this is not the
✦ LIBER ✦
On multiplicative graphs and the product conjecture
✍ Scribed by R. Häggkvist; P. Hell; D. J. Miller; V. Neumann Lara
- Publisher
- Springer-Verlag
- Year
- 1988
- Tongue
- English
- Weight
- 717 KB
- Volume
- 8
- Category
- Article
- ISSN
- 0209-9683
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
On a multiplicative graph function conje
✍
Lih-Hsing Hsu
📂
Article
📅
1983
🏛
Elsevier Science
🌐
English
⚖ 802 KB
Behzad-Vizing conjecture and Cartesian-p
✍
B. Zmazek; J. Ẑerovnik
📂
Article
📅
2002
🏛
Elsevier Science
🌐
English
⚖ 308 KB
On a Vizing-like conjecture for direct p
✍
Sandi Klavẑar; Blaẑ Zmazek
📂
Article
📅
1996
🏛
Elsevier Science
🌐
English
⚖ 163 KB
Let 7(G) be the domination number of a graph G, and let G ×H be the direct product of graphs G and H. It is shown that for any k t> 0 there exists a graph G such that 7(G × G) ~< 7(G) 2 -k. This in particular disproves a conjecture from .
Graham’s pebbling conjecture on product
✍
Rongquan Feng; Ju Young Kim
📂
Article
📅
2001
🏛
SP Science China Press
🌐
English
⚖ 318 KB
Colourings of the cartesian product of g
✍
Attila Pór; David R. Wood
📂
Article
📅
2009
🏛
Springer-Verlag
🌐
English
⚖ 551 KB
Hedetniemi's Conjecture and the Retracts
✍
Benoit Larose; Claude Tardif
📂
Article
📅
2000
🏛
Springer-Verlag
🌐
English
⚖ 236 KB