The roots of \(\sigma\)-polynomials (Q1413709): Difference between revisions

Let \(\sigma(G, x)\) denote the \(\sigma\)-polynominl of a graph \(G\). A graph \(G\) is called \(\sigma\)-real if all zeros of \(\sigma(G, x)\) are real. Otherwise \(G\) is called \(\sigma\)-unreal. Brenti et al. delimited all \(\sigma\)-unreal graphs with 8 and 9 vertices and proposed the following question. For \(n\in\mathbb{N}\), let \(\delta(n)\) be the minimum edge-density over all \(\sigma\)-unreal graphs with \(n\) vertices. Given a good lower bound for \(\delta(n)\), is there a constant \(c> 0\) such that \(\delta(n)> c\) for sufficiency large \(n\)? The authors study the roots of \(\sigma(G, x)\) by applying the theory of adjoint polynomials, establish a way of constructing \(\sigma\)-unreal graphs and give a negative answer to the question above.