Connected \(\mathscr{F}\) domination
Downloads
DOI:
https://doi.org/10.26637/MJM0804/0093Abstract
In this paper we introduce connected \(\mathscr{F}\) dominating set and minimum connected \(\mathscr{F}\) dominating set. Moreover, we determine some bounds of minimum connected \(\mathscr{F}\) dominating set and some basic results.
Keywords:
Graph Operations, Connected \(\mathscr{F} \) dominationMathematics Subject Classification:
Mathematics- Pages: 1894-1897
- Date Published: 01-10-2020
- Vol. 8 No. 04 (2020): Malaya Journal of Matematik (MJM)
M. Chelbik and J. Chelbikova, Approximation hardness of dominating set problems in bounded degree graphs, $I n$ formation and Computation, 206(11)(2008), 1264-1275.
Frank Harary, Graph Theory, Courier Dover Publications, 2015.
Manju Raju, Kiran R. Bhutani, Babak Moazzez, S.arumugam, On $mathscr{F}$-domination in graphs, AKCE International Journal of Graphs and Combinatorics, 17(1)(2020), 60-64.
Sabidussi Gert. The lexicographic product of graphs, Duke Math. J, 28(1961), 573-578.
- NA
Similar Articles
- M. Rowthri, B. Amudhambigai, Fuzzy \(\alpha-\psi^*\) operator on fuzzy hyperconnected, fuzzy door and fuzzy Urysohn spaces , 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.
