Abstract
Let γ( 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 ⩾ 0 there exists a graph G such that γ( G × G) ⩽ γ( G) 2 − k. This in particular disproves a conjecture from [5].
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
