Domination Polynomials Ep 4 / 4: Optimal Graphs
This video covers the optimal graphs for domination polynomials. A graph G with n vertices and m edges is said to be optimal for domination polynomials if for all graphs H with n vertices and m edges, and for all x greater than or equal to zero, D(G, x) greater than or equal to D(H, x). Here is a link to learn more about optimal graphs for domination polynomials:
https://arxiv.org/pdf/1904.06267.pdf
Watch video Domination Polynomials Ep 4 / 4: Optimal Graphs online without registration, duration hours minute second in high quality. This video was added by user Vital Sine 02 November 2021, don't forget to share it with your friends and acquaintances, it has been viewed on our site 315 once and liked it 11 people.