Abstract

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$‎.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call