Some notes on isolated signed total domination number for digraphs
Downloads
DOI:
https://doi.org/10.26637/MJM0804/0182Abstract
An isolated signed total dominating function (ISTDF) of a digraph is a function \(f: V(D) \rightarrow\{-1,+1\}\) such that \(\sum_u \in N-(v) \geq 1\) for every vertex \(v \in V(D)\) and for at least one vertex of \(w \in V(D), f\left(N^{-}(w)\right)=+1\). An isolated signed totaldomination number of \(\mathrm{D}\), denoted by \(\gamma_{\text {ist }}(D)\), in the minimal weight of an isolated signed total dominating function of \(D\). In this paper, we study some properties of ISTDF.
Keywords:
Signed total dominating set, isolated vertex, digraphMathematics Subject Classification:
Mathematics- Pages: 2356-2358
- Date Published: 01-10-2020
- Vol. 8 No. 04 (2020): Malaya Journal of Matematik (MJM)
Bohdan Zelinka, Liberec, Signed total domination number of a graph, Czechoslovak Mathematical Journal, 51(126)(2001), 2252298 . DOI: https://doi.org/10.1023/A:1013782511179
Bohdan Zelinka and Liberec, Signed domination numbers of directed graphs, Czechoslovak Mathematical Journal, $55(130)(2005), 479-482$. DOI: https://doi.org/10.1007/s10587-005-0038-5
J.A. Bondy and U.S.R. Murty, Graph Theory with Applications, Elsevier, North Holland, New York, (1986).
J.E. Dunbar, S.T. Hedetniemi, M. A. Henning and P. J. Slater, Signed domination in graphs. In: Graph Theory, Combinatorics and Applications. Proc. 7th Internat. Conf. Combinatorics, Graph Theory, Applications, (Y. Alavi, A. J. Schwenk, eds.). John Wiley and Sons, Inc., 1 (1995) 311-322.
J. E. Dunbar, S. T. Hedetniemi, M. A. Henning, and A. A. McRae, Minus domination in regular graphs, Discrete Math., 149 (1996), 311-312. DOI: https://doi.org/10.1016/0012-365X(94)00329-H
T.W. Haynes, S.T. Hedetniemi and P.J. Slater, Fundamental of Domination in Graphs, Marcel Dekker Inc., New York-BaselHong Kong, 1998.
H. Karami, S.M. Sheikholeslami, AbdollahKhodkar Note Lower bounds on the signed domination numbers
of directed graphs, Discrete Mathematics, 309 (2009), 2567-2570. DOI: https://doi.org/10.1016/j.disc.2008.04.001
Lutz Volkmann, Signed domination and signed domatic number of graphs, DiscussionesMathematicae Graph Theory, 31 (2011), 415-427. DOI: https://doi.org/10.7151/dmgt.1555
RamyShaheen, On the signed domination number of the Cartesian product of two directed cycles, Open Journal of Discrete Mathematics, 5 (2015), 54-64. DOI: https://doi.org/10.4236/ojdm.2015.53005
- NA
Similar Articles
- P. Kamal Devi, Identification of shortest path with Dijkstra’s algorithm through the distribution function analysis of flow and connectivity in non-directed graphs , Malaya Journal of Matematik: Vol. 8 No. 04 (2020): Malaya Journal of Matematik (MJM)
You may also start an advanced similarity search for this article.
Metrics
Published
How to Cite
Issue
Section
License
Copyright (c) 2020 MJM
This work is licensed under a Creative Commons Attribution 4.0 International License.