About Secured Isolate Inclusive Sets in Graphs

D.K. Thakkar¹ , N.J. Savaliya²

Section:Research Paper, Product Type: Isroset-Journal
Vol.6 , Issue.1 , pp.276-281, Feb-2019

CrossRef-DOI:   https://doi.org/10.26438/ijsrmss/v6i1.276281

Online published on Feb 28, 2019

Copyright © D.K. Thakkar, N.J. Savaliya . This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
 

View this paper at   Google Scholar | DPI Digital Library

XML View     PDF Download

How to Cite this Paper

184 Views    143 Downloads    86 Downloads

Abstract :
In this paper we introduce in new concept call secured isolate inclusive sets in graphs. We also define maximum secured isolate inclusive set and we define the cardinality of a maximum secured isolate inclusive set to be the secured isolate inclusive number of the graph G. We observe that a 1-maximal isolate inclusive set cannot be a secured isolate inclusive set. We also observe that if a secured isolate inclusive set contains a pendent vertex then it is an isolate in this set. It v & u are pendent vertices which are adjacent and M is a maximum secured isolate inclusive set of G then v∈M & u∉M or u∈M & v∉M.

Key-Words / Index Term :
isolate inclusive set, maximum isolate inclusive set, 1-maximal isolate inclusive set, secured isolate inclusive set, maximum secured isolate inclusive set, maximal secured isolate inclusive set, external private neighbourhood, maximum independent set, independent number.

References :
[1] D.K.Thakkar and J.C.Bosamiya, “Graph critical with respect to independent domination”, International Journal of Discrete Mathematics Sciences and Cryptography, Vol. 16, pp. 179-186, 2013.
[2] D.K.Thakkar and N.J.Savaliya, “On Isolate Inclusive sets in Graphs “, International Journal of Innovation in Science and Mathematical, Vol. 5, Issue 3, pp. 74-76, 2017.
[3] D.K.Thakkar and N.J.Savaliya, “About Isolate Domination in Graphs “, International Journal of Mathematical Archive, Vol. 8, Issue 11, pp. 171-178, 2017.
[4] Michel A. Henning, Anders Yeo, “Total Domination In graphs”, Springer, New York, 2013.
[5] I. Sahul Hamid and S. Balamurugan, ”Isolate Domination Numberand Maximum Degree” bulletin of the international mathematical virtual institute, Vol. 3, pp. 127-133, 2013.
[6] I. Sahul Hamid and S. Balamurugan, “Isolate Domination In graphs”, Arab Journal of Mathematical Science Math Sci, Vol. 22, pp. 232-241, 2016.
[7] T.W.Haynes, S.T.Hedetniemi, P.J.Slater, “Fundamental of Domination In graphs”, New York, 1998.