Abstract
Let Γt−(G) be upper minus total domination number of G. In this paper, We establish an upper bound of the upper minus total domination number of a regular graph G and characterize the extremal graphs attaining the bound. Thus, we answer an open problem by Yan, Yang and Shan
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Paper version not known
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 callMore From: Acta Mathematicae Applicatae Sinica, English Series
Paper Title
Journal
Date
