1,993 research outputs found

    On the Real Roots of Domination Polynomials

    Get PDF
    A dominating set SS of a graph GG of order nn is a subset of the vertices of GG such that every vertex is either in SS or adjacent to a vertex of SS. The domination polynomial is defined by D(G,x)=βˆ‘dkxkD(G,x) = \sum d_k x^k where dkd_k is the number of dominating sets in GG with cardinality kk. In this paper we show that the closure of the real roots of domination polynomials is (βˆ’βˆž,0](-\infty,0]
    • …
    corecore