International Journal of Mathematics Trends and Technology
Volume 37 | Number 1 | Year 2016 | Article Id. IJMTT-V37P502 | DOI : https://doi.org/10.14445/22315373/IJMTT-V37P502
If i; j belong to a permutation on n symbols A = f1; 2; :::; ng and i < j then the line of i crosses the line of j in the permutation if i appears after j in the image sequence s() and if the no. of crossing lines of i is less than the no. of crossing lines of j then i global dominates j. A subset D of A, whose closed neighborhood is A in is a dominating set of . D is a global dominating set of if every i in A - D is global dominated by some j in D. In this paper the global domination number of a permutation is investigated by means of crossing lines.
[1] M.Murugan \Topics in Graph Theory and Algorithms", Muthali Publishing House, Chen- nai, India,2003.
[2] E.Sampathkumar \The Global Domination Number of a Graph", Journal of math. Phy. Science, Volume:23, no:5.(1989).
[3] J.Chithra, S.P.Subbiah and V.Swaminathan \Domination in Permutation Graphs", International Journal of Computing Algorithm, Volume:03, Pages:549-553.(2014).
S.Vijayakumar, C.V.R:Harinarayanan, "Global Domination in Permutation," International Journal of Mathematics Trends and Technology (IJMTT), vol. 37, no. 1, pp. 6-15, 2016. Crossref, https://doi.org/10.14445/22315373/IJMTT-V37P502
PDF 
Abstract 
Keywords 
References 
Citation