摘要
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
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
基金
Supported by the National Natural Science Foundation of China(No.61170302)
Innovation Project of Optimization and Control of Network Systems of Zhejiang Normal University(ZSDZZZZXK03)
