Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Upper minus total domination number of regular graphs

Upper minus total domination number of regular graphs 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 http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Acta Mathematicae Applicatae Sinica Springer Journals

Upper minus total domination number of regular graphs

Loading next page...
 
/lp/springer-journals/upper-minus-total-domination-number-of-regular-graphs-dl33JiZtT7
Publisher
Springer Journals
Copyright
Copyright © 2017 by Institute of Applied Mathematics, Academy of Mathematics and System Sciences, Chinese Academy of Sciences and Springer-Verlag Berlin Heidelberg
Subject
Mathematics; Applications of Mathematics; Math Applications in Computer Science; Theoretical, Mathematical and Computational Physics
ISSN
0168-9673
eISSN
1618-3932
DOI
10.1007/s10255-017-0637-6
Publisher site
See Article on Publisher Site

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

Journal

Acta Mathematicae Applicatae SinicaSpringer Journals

Published: Mar 15, 2017

References