The limiting-hyperbola conjecture for domination roots of generalized friendship graphs

About 11 years old · traced to

Let F4,nF_{4,n} be the generalized friendship graph with parameter nn, and consider the complex zeros of its domination polynomial D(F4,n,x)D(F_{4,n},x) as nn varies. Limiting-hyperbola conjecture. The limit of domination roots of F4,nF_{4,n} is a hyperbola. The source introduces this as a question suggested by a plot of the complex domination roots, but gives no proof or precise definition of the limiting set.

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.