Advanced search
Publication Cover
Journal of Taibah University for Science Volume 13, 2019 - Issue 1
Submit an article Journal homepage
693
Views
5
CrossRef citations to date
0
Altmetric
Research Articles

Outer-independent k-rainbow domination

Qiong KangSchool of Computer Science, Yangtze University, Jingzhou, People's Republic of ChinaORCID Iconhttps://orcid.org/0000-0001-8123-9184View further author information
ORCID Icon,
Vladimir SamodivkinDepartment of Mathematics, University of Architecture, Civil Engineering and Geodesy, Sofia, BulgariaORCID Iconhttps://orcid.org/0000-0001-7934-5789View further author information
ORCID Icon,
Zehui ShaoInstitute of Computing Science and Technology, Guangzhou University, Guangzhou, People's Republic of ChinaCorrespondence[email protected]
View further author information
,
Seyed Mahmoud SheikholeslamiDepartment of Mathematics, Azarbaijan Shahid Madani University, Tabriz, IranView further author information
&
Marzieh SoroudiDepartment of Mathematics, Azarbaijan Shahid Madani University, Tabriz, IranORCID Iconhttps://orcid.org/0000-0002-6677-6835View further author information
ORCID Icon
Pages 883-891 | Received 02 Jun 2019, Accepted 03 Aug 2019, Published online: 20 Aug 2019

References

  • West DB. Introduction to graph theory. 2nd ed. Upper Saddle River: Prentice-Hall, Inc.; 2000.
  • Gallai T. Uber extreme Punkt- und Kantenmengen. Ann Univ Sci Budapest Eotvos Sect Math. 1959;2:133–138.
  • Ahangar HA, Chellali M, Samodivkin V. Outer independent Roman dominating functions in graphs. Int J Comput Math. 2017;94:2547–2557. doi: 10.1080/00207160.2017.1301437
  • Krzywkowski M, Venkatakrishnan YB. Bipartite theory of graphs: outer-independent domination. Natl Acad Sci Lett. 2015;38:169–172. doi: 10.1007/s40009-014-0315-7
  • Krzywkowski M. An upper bound on the 2-outer-independent domination number of a tree. C R Math. 2011;349:1123–1125. doi: 10.1016/j.crma.2011.10.005
  • Li Z, Shao Z, Lang F, et al. Computational complexity of outer-independent total and total Roman domination numbers in trees. IEEE Access. 2018;6:35544–35550. doi: 10.1109/ACCESS.2018.2851972
  • Rad NJ, Krzywkowski M. 2-Outer-independent domination in graphs. Natl Acad Sci Lett. 2015;38:263–269. doi: 10.1007/s40009-015-0389-x
  • Brešar B, Henning MA, Rall DF. Rainbow domination in graphs. Taiwanese J Math. 2008;12:201–213. doi: 10.11650/twjm/1500602498
  • Amjadi J, Dehgardi N, Furuya M, et al. A sufficient condition for large rainbow domination number. Int J Comput Math Comput Syst Theory. 2017;2:53–65. doi: 10.1080/23799927.2017.1330282
  • Brešar B, Kraner Šumenjak T. On the 2-rainbow domination in graphs. Discrete Appl Math. 2007;155:2394–2400. doi: 10.1016/j.dam.2007.07.018
  • Chang GJ, Wu J, Zhu X. Rainbow domination on trees. Discrete Appl Math. 2010;158:8–12. doi: 10.1016/j.dam.2009.08.010
  • Chellali M, Haynes TW, Hedetniemi ST. Bounds on weak roman and 2-rainbow domination numbers. Discrete Appl Math. 2014;178:27–32. doi: 10.1016/j.dam.2014.06.016
  • Meierling D, Sheikholeslami SM, Volkmann L. Nordhaus–Gaddum bounds on the k-rainbow domatic number of a graph. Appl Math Lett. 2011;24:1758–1761. doi: 10.1016/j.aml.2011.04.046
  • Sheikholeslami SM, Volkmann L. The k-rainbow domatic number of a graph. Discuss Math Graph Theory. 2012;32:129–140. doi: 10.7151/dmgt.1591
  • Xu G. 2-rainbow domination in generalized Petersen graphs P(n,3). Discrete Appl Math. 2009;157:2570–2573. doi: 10.1016/j.dam.2009.03.016
  • Fan W, Ye A, Miao F, et al. Outer-independent Italian domination in graphs. IEEE Access. 2019;7:22756–22762. doi: 10.1109/ACCESS.2019.2899875
  • Krzywkowski M. Total outer-independent domination in graphs, Manuscript.
  • Krzywkowski M. A lower bound on the total outer-independent domination number of a tree. C R Math. 2011;349:7–9. doi: 10.1016/j.crma.2010.11.021

Related research

People also read lists articles that other readers of this article have read.

Recommended articles lists articles that we recommend and is powered by our AI driven recommendation engine.

Cited by lists all citing articles based on Crossref citations.
Articles with the Crossref icon will open in a new tab.