Intro to Domination Polynomials Part 1/4

This video introduces domination polynomials with examples included, and covers the basic properties of domination polynomials. The domination polynomial of a graph G, written as D(G, x) is the polynomial with k-degree coefficient equal to the cardinality of the set of dominating sets with k vertices in graph G. That is, the coefficient of the k-th degree term is the number of dominating sets with k vertices in graph G. Several properties of domination polynomials can also be defined and examined, such as the multiplicativity of domination polynomials over connected components of a graph.
#graphtheory

For more information, see these links:

Recommended Books:
******************************** Hypergraph Theory ********************************

******************************** Graph Theory ********************************

******************************** Misc. Undergraduate Mathematics ********************************

These are my Amazon Affiliate links. As an Amazon Associate I may earn commissions for purchases made through the links above.

[atrsankaralingamvalarmathi]

Crystal Clear Explanation Sir... Thank you for accepting my request 🙏 your classes are very interesting and informative 🙏 Thank you so much Sir