let $g$ be a simple graph of order $n$‎. ‎we consider the‎ ‎independence polynomial and the domination polynomial of a graph‎ ‎$g$‎. ‎the value of a graph polynomial at a specific point can give‎ ‎sometimes a very surprising information about the structure of the‎ ‎graph‎. ‎in this paper we investigate independence and domination‎ ‎polynomial at $-1$ and $1$‎.

let g = (v, e) be a simple graph. hosoya polynomial of g isd(u,v)h(g, x) = {u,v}v(g)x , where, d(u ,v) denotes the distance between vertices uand v. as is the case with other graph polynomials, such as chromatic, independence anddomination polynomial, it is natural to study the roots of hosoya polynomial of a graph. inthis paper we study the roots of hosoya polynomials of some specific graphs.

Let G = (V, E) be a simple graph. Hosoya polynomial of G is d(u,v) H(G, x) = {u,v}V(G)x , where, d(u ,v) denotes the distance between vertices u and v. As is the case with other graph polynomials, such as chromatic, independence and domination polynomial, it is natural to study the roots of Hosoya polynomial of a graph. In this paper we study the roots of Hosoya polynomials of some specific g...

The independence polynomial of a graph G is the function i(G, x) = ∑k 0 ikx , where ik is the number of independent sets of vertices in G of cardinality k. We investigate here the average independence polynomial, where the average is taken over all independence polynomials of (labeled) graphs of order n. We prove that while almost every independence polynomial has a nonreal root, the average in...

The independence polynomial of a graph is the generating polynomial for the number of independent sets of each size and its roots are called independence roots. We investigate the stability of such polynomials, that is, conditions under which the independence roots lie in the left half-plane. We use results from complex analysis to determine graph operations that result in a stable or nonstable...

in this paper we define ?-independent (a weak-version of independence), kronecker and dissociate sets on hypergroups and study their properties and relationships among them and some other thin sets such as independent and sidon sets. these sets have the lacunarity or thinness property and are very useful indeed. for example varopoulos used the kronecker sets to prove the malliavin theorem. in t...

The independence polynomial of a graph G is the polynomial ∑ ikx , where ik denote the number of independent sets of cardinality k in G. In this paper we study unimodality problem for the independence polynomial of certain classes of graphs.

The independence polynomial of a graph G is the polynomial ∑ I x, summed over all independent subsets I ⊆ V (G). We show that if G is clawfree, then there exists a Mehler formula for its independence polynomial. This was proved for matching polynomials in [18] and extends the combinatorial proof of the Mehler formula imagined by Foata [9]. It implies immediately that all the roots of the indepe...