Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/10285
Title: Upper minus total domination in small-degree regular graphs
Authors: Yan, H 
Yang, X 
Shan, E
Keywords: Bounds
Minus total domination
Regular graph
Issue Date: 2007
Publisher: North-Holland
Source: Discrete mathematics, 2007, v. 307, no. 21, p. 2453-2463 How to cite?
Journal: Discrete mathematics 
Abstract: A function f : V (G) → { - 1, 0, 1 } defined on the vertices of a graph G is a minus total dominating function (MTDF) if the sum of its function values over any open neighborhood is at least one. An MTDF f is minimal if there does not exist an MTDF g : V (G) → { - 1, 0, 1 }, f ≠ g, for which g (v) ≤ f (v) for every v ∈ V (G). The weight of an MTDF is the sum of its function values over all vertices. The minus total domination number of G is the minimum weight of an MTDF on G, while the upper minus domination number of G is the maximum weight of a minimal MTDF on G. In this paper we present upper bounds on the upper minus total domination number of a cubic graph and a 4-regular graph and characterize the regular graphs attaining these upper bounds.
URI: http://hdl.handle.net/10397/10285
ISSN: 0012-365X
EISSN: 1872-681X
DOI: 10.1016/j.disc.2006.11.011
Appears in Collections:Journal/Magazine Article

Access
View full-text via PolyU eLinks SFX Query
Show full item record

SCOPUSTM   
Citations

10
Last Week
0
Last month
0
Citations as of Aug 13, 2017

WEB OF SCIENCETM
Citations

4
Last Week
0
Last month
Citations as of Aug 12, 2017

Page view(s)

54
Last Week
2
Last month
Checked on Aug 13, 2017

Google ScholarTM

Check

Altmetric



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.