Abstract
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.
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 callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
