Isolate Domination in Total graphs


Abstract views: 43 / PDF downloads: 36

Authors

  • Gloria Fernandes Department of Mathematics, CHRIST(Deemed to be University), Bengaluru, Karnataka, India
  • Tabitha Agnes Mangam Department of Mathematics, CHRIST(Deemed to be University), Bengaluru, Karnataka, India

Keywords:

Domination number, Isolate domination number, Total graph

Abstract

A dominating set $S$ of a graph $G$ is said to be an isolate dominating set of $G$ if induced subgraph on $S$ has at least one isolated vertex. An isolate dominating set $S$ is said to be a minimal isolate dominating set if no proper subset of $S$ is an isolate dominating set. The isolate domination number $\gamma_0$ is defined as the minimum cardinality of minimal isolate dominating set. In this paper, we investigate the isolate domination number of total graphs of certain classes of graphs.

Author Biographies

Gloria Fernandes, Department of Mathematics, CHRIST(Deemed to be University), Bengaluru, Karnataka, India

 

 

Tabitha Agnes Mangam, Department of Mathematics, CHRIST(Deemed to be University), Bengaluru, Karnataka, India

 

 

Downloads

Published

15-05-2018

How to Cite

Gloria Fernandes, & Tabitha Agnes Mangam. (2018). Isolate Domination in Total graphs. International Journal of Mathematics And Its Applications, 6(2 - A), 135–139. Retrieved from http://ijmaa.in/index.php/ijmaa/article/view/655

Issue

Vol. 6 No. 2 - A (2018)

Section

Research Article

License

Creative Commons License

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