Abstract

We give sharp upper bounds on the upper signed domination number of nearly regular graphs and on the minus domination number of connected cubic graphs.

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