Abstract
In this paper, we introduce the concepts of redundant constraint and exceptional vertex which play an important role in the characterization of universal minimal total dominating functions (universal MTDFs), and establish some further results on universal MTDFs in general graphs. By extending these results to trees, we get a necessary and sufficient condition for universal MTDFs and show that there is a good algorithm for deciding whether a given tree has a universal MTDF.
Sign-in/Register to access full text options 
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.
