Unique isolate domination in graphs
Downloads
DOI:
https://doi.org/10.26637/MJM0704/0016Abstract
A dominating set $S$ of a graph $G$ is said to be an isolate dominating set of $G$ if the induced subgraph $\langle S\rangle$ has at least one isolated vertex [6].
A dominating set $S$ of a graph $G$ is said to be an unique isolate dominating set(UIDS) of $G$ if $\langle S\rangle$ has exactly one isolated vertex. An UIDS $S$ is said to be minimal if no proper subset of $S$ is an UIDS. The minimum cardinality of a minimal UIDS of $G$ is called the UID number, denoted by $\gamma_0^U(G)$. This paper includes some properties of UIDS and gives the UID number of paths, complete $k$-partite graphs and disconnected graphs. Finally, the role played by UIDS in the domination chain has been discussed in detail.
Keywords:
Isolate dominating set, unique isolate dominating set, unique isolate domination numberMathematics Subject Classification:
Mathematics- Pages: 720-723
- Date Published: 01-10-2019
- Vol. 7 No. 04 (2019): Malaya Journal of Matematik (MJM)
B.H. Arriola, Isolate domination in the join and corona of graphs, Applied Mathematical Sciences 9 (2015), 15431549
G.Chartrand, Lesniak, Graphs and digraphs. Fourth ed., CRC press, Boca Raton, 2005.
E.J.Cockayne, S.T.Hedetniemi, D.J.Miller, Properties of hereditary hypergraphs and middle graphs, Canad. Math. Bull, 21 (1978) $461-468$.
T.W.Haynes, S.T.Hedetniemi, P.J.Slater, Fundamental of domination in Graphs, Marcel Dekker, New York, 1998.
I.Sahul Hamid, S.Balamurugan, Isolate domination in Unicycle Graphs, International journal of mathematics and soft Computing 3 (2013), 79-83.
I.Sahul Hamid, S.Balamurugan, Isolate domination in graphs Arab J Math Sci., 22 (2016), 232-241.
- NA
Metrics
Published
How to Cite
Issue
Section
License
Copyright (c) 2019 MJM
This work is licensed under a Creative Commons Attribution 4.0 International License.
