Fact Type Results in Half Domination in Graphs

S. Balamurugan; P. Sixthus Renita

doi:https://doi.org/10.14445/22315373/IJMTT-V8P502

International Journal of Mathematics Trends and Technology

Research Article | Open Access | Download PDF

Volume 8 | Number 1 | Year 2014 | Article Id. IJMTT-V8P502 | DOI : https://doi.org/10.14445/22315373/IJMTT-V8P502

Fact Type Results in Half Domination in Graphs

S. Balamurugan , P. Sixthus Renita

Abstract

Let G = (V, E) be a finite graph with n vertices and m edges. A subset D⊆ V of vertices in a graph G is called half dominating set if at least half of the vertices of V(G) are either in D or adjacent to vertices of D. (i.e) |N[D]| ≥ ⌈|V(G)/2|⌉ . In this paper we deals with fact type results in half domination number of G.

Keywords

Half Dominating Set, Half Domination Number

References

[1].E.J. Cockayne, S.J. Hedetniemi, Towards of Theory of Domination in Graphs, Networks – 7 (1977), 247 – 261.
[2]. T.W. Haynes, S.T. Hedetniemi, Peter J. Slater, Fundamentals of Domination in Graphs, 1998 by Marcel Dekker, Inc., New York.
[3]. J. Joseline Manora and V. Swaminathan, Majority Domatic Number of a Graph, Global Journal of Pure and Applied Mathematic, Vol.6, No. 3 (2010), 275-283.
[4]. J. Joseline Manora and V. Swaminathan, Majority Neighbourhood Number of a Graph,Scienta Magna, Northwest University, P.R.China, Vol.6, No.2(2010),20-25.
[5]. Frank Harary, Graph Theory, Addison Wesley Reading, MA (1969).
[6]. T.W. Haynes, S.T. Hedetniemi, Peter J. Slater, Domination in Graphs: Advancd Topics, Marcel dekker, Inc., (1998).

Citation :

S. Balamurugan , P. Sixthus Renita, "Fact Type Results in Half Domination in Graphs," International Journal of Mathematics Trends and Technology (IJMTT), vol. 8, no. 1, pp. 8-11, 2014. Crossref, https://doi.org/10.14445/22315373/IJMTT-V8P502