The odd-order nonzero domination-root conjecture for generalized friendship graphs

About 11 years old · traced to

Let F4,nF_{4,n} be the generalized friendship graph with parameter nn, and let a domination root mean a real zero of its domination polynomial D(F4,n,x)D(F_{4,n},x). Odd-order nonzero-root conjecture. For every odd natural number nn, no nonzero real number is a domination root of F4,nF_{4,n}. This is presented as a conjectural root property of the domination polynomial; the supplied source does not establish its status.

References

Primary source

Somayeh Jahari and Saeid Alikhani, “Domination polynomial of generalized friendship and generalized book graphs”, arXiv:1501.05856 (2015).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.