International Journal of Engineering, Science and Mathematics
  • Year: 2020
  • Volume: 9
  • Issue: 5

Generalised redundantgirth domination number and its connectivity of corona graphs

  • Author:
  • M. Sudalaikannu, G. Victor Emmanuel, L. Shyamala, I. Beno, G. Princeton Lazarus, S. Raja
  • Total Page Count: 9
  • Page Number: 29 to 37

Department of Mathematics, St. Mother Theresa Engineering College, Thuthukudi-628102

* Author correspondence: G. Victor Emmanuel, Department of Mathematics, St. Mother Theresa Engineering College, Thuthukudi-628102

Online published on 4 January, 2021.

Abstract

A set DσV(G°H) is called a redundant girth dominating set of Corona graph G if every vertex in V-D is adjacent to at least one vertex in the girth(cycle) graph of G and N[x]-N[D-x]=σ. The minimum cardinality of a redundant girth dominating set of G is called redundant girth domination number of G denoted by γrg(G°H). The connectivity κ(G°H) of a Corona graph G is the minimum number of vertices whose removal results in a disconnected or trivial graph.

Keywords

Redundant, Girth, Domination Number, Connectivity, Redundant Girth domination number