Global Connected Accurate and Maximal Domination in Graphs

M. Nithya kalyani; C.Saranya

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

International Journal of Mathematics Trends and Technology

Research Article | Open Access | Download PDF

Volume 54 | Number 4 | Year 2018 | Article Id. IJMTT-V54P538 | DOI : https://doi.org/10.14445/22315373/IJMTT-V54P538

Global Connected Accurate and Maximal Domination in Graphs

M. Nithya kalyani, C.Saranya

Abstract

In this paper the concepts global connected accurate and maximal domination sets are introduced. The numbers 𝛾𝑔𝑐𝑎 (𝐺) and 𝛾𝑔𝑐𝑚 (𝐺) of a global connected accurate and maximal domination sets are determined and also a Nordhaus - Gaddum type of result is established.

Keywords

Global domination set, Connected accurate domination set, Connected Maximal domination set, Global connected accurate domination set, Global connected maximal domination set.

References

[1] S. Arumugam and S. Ramachandran, “Invitattion to graph theory,” Scitech Publications (India) Pvt. Ltd., (2012).
[2] V. R. Kulli and Bidarhalli Janakiram, “The dominating graph,” Graph Theory Notes of New York XLVI, 5-8 (2004).
[3] V. R. Kulli and M. B. Kattimani, “Accurate domination in graphs,” In advances in Domination Theory I, V. R. Kulli, ed., Vishwa International Publications, Gulbarga, India, 9-14 (2012).
[4] V. R. Kulli and M. B. Kattimani, “Global Accurate domination in graphs,” Inter. J. Scientific and Research Publications, 3(10), 1-3 (2013).
[5] V. R. Kulli and M. B. Kattimani, “Connected Accurate domination in graphs,” Journal of Computer and Mathematical Science, Vol. 6(120, 682-687, (2015).

Citation :

M. Nithya kalyani, C.Saranya, "Global Connected Accurate and Maximal Domination in Graphs," International Journal of Mathematics Trends and Technology (IJMTT), vol. 54, no. 4, pp. 332-336, 2018. Crossref, https://doi.org/10.14445/22315373/IJMTT-V54P538