Connected Boundary Domination in Graphs


Abstract views: 56 / PDF downloads: 28

Authors

  • Mohammed Alatif Department of Mathematics, P.E.S.College of Engineering, Mandya, Karnataka, India
  • Puttaswamy Department of Mathematics, P.E.S.College of Engineering, Mandya, Karnataka, India
  • S. R. Nayaka Department of Mathematics, P.E.S.College of Engineering, Mandya, Karnataka, India

Keywords:

Boundary dominating set, Connected Boundary dominating set, Connected Boundary domination number

Abstract

Let $G = (V;E)$ be a connected graph. A dominating set $S\subseteq V$ is called a connected dominating set if $\langle S \rangle $ is connected subgraph. In this paper we introduce the connected boundary dominating set and analogous to the connected boundary domination number, we define the connected boundary domatic number in graphs. Exact values of some standard graphs are obtained and some other interesting results are established.

Downloads

Published

30-01-2016

How to Cite

Mohammed Alatif, Puttaswamy, & S. R. Nayaka. (2016). Connected Boundary Domination in Graphs. International Journal of Mathematics And Its Applications, 4(1 - A), 33–38. Retrieved from https://ijmaa.in/index.php/ijmaa/article/view/543

Issue

Vol. 4 No. 1 - A (2016)

Section

Research Article

License

Creative Commons License

This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.

Most read articles by the same author(s)