Authors: H.Abdollahzadeh Ahangar
A set of vertices S in a graph G is called to be a Smarandachely dominating k-set, if each vertex of G is dominated by at least k vertices of S. Particularly, if k = 1, such a set is called a dominating set of G. The Smarandachely domination number k(G) of G is the minimum cardinality of a Smarandachely dominating set of G. For abbreviation, we denote 1(G) by (G). In 1996, Reed proved that the domination number (G) of every n-vertex graph G with minimum degree at least 3 is at most 3n/8. Also, he conjectured that (H) ≥ ⌈n/3⌉ for every connected 3-regular n-vertex graph H. In [?], the authors presented a sequence of Hamiltonian cubic graphs whose domination numbers are sharp and in this paper we study forcing domination number for those graphs.
Comments: 5 Pages.
Download: PDF
[v1] 2014-03-14 06:36:18
Unique-IP document downloads: 91 times
Vixra.org is a pre-print repository rather than a journal. Articles hosted may not yet have been verified by peer-review and should be treated as preliminary. In particular, anything that appears to include financial or legal advice or proposed medical treatments should be treated with due caution. Vixra.org will not be responsible for any consequences of actions that result from any form of use of any documents on this website.
Add your own feedback and questions here:
You are equally welcome to be positive or negative about any paper but please be polite. If you are being critical you must mention at least one specific error, otherwise your comment will be deleted as unhelpful.