The strong nonsplit domination polynomial of some graphs
2020 ◽
Vol 12
(04)
◽
pp. 2050053
The strong nonsplit domination polynomial of a graph [Formula: see text] of order [Formula: see text] is the polynomial [Formula: see text], where [Formula: see text] is the number of strong nonsplit dominating sets of [Formula: see text] of size [Formula: see text] and [Formula: see text] is the strong nonsplit domination number of [Formula: see text]. We obtain some properties of [Formula: see text] and its coefficients. Also, we compute the polynomial for some specific graphs.
2020 ◽
Vol 12
(06)
◽
pp. 2050082
Keyword(s):
Keyword(s):
2020 ◽
Vol 12
(02)
◽
pp. 2050025
Keyword(s):
Keyword(s):