$Y \overline{Y}$ Domination in Bipartite Graphs

Authors

  • Y.B. Venkatakrishnan Department of Mathematics, SASTRA University, Tanjore, India
  • V. Swaminathan Reader (Retd.), Ramanujan Research center, Saraswathi Narayanan College, Madurai, India

DOI:

https://doi.org/10.26713/jims.v4i1.64

Keywords:

$Y\overline{Y}$-dominating set, $Y$-dominating set, $X$-dominating set

Abstract

Let $G$ be a bipartite graph. A subset $S$ of $X$ is called a $Y \overline{Y}$ dominating set if $S$ is a $Y$-dominating set and $X-S$ is not a $Y$-dominating set. A subset $S$ of $X$ is called a minimal $Y \overline{Y}$ dominating set if any proper subset of $S$ is not a $Y \overline{Y}$ dominating set. The minimum cardinality of a minimal  $Y \overline{Y}$ dominating set is called the $Y \overline{Y}$ domination number of $G$ and is denoted by $\gamma_{Y \overline{Y}}(G)$. In this paper some results on $Y \overline{Y}$ domination number are obtained.

Downloads

Download data is not yet available.

Downloads

CITATION

How to Cite

Venkatakrishnan, Y., & Swaminathan, V. (2012). $Y \overline{Y}$ Domination in Bipartite Graphs. Journal of Informatics and Mathematical Sciences, 4(1), 23–27. https://doi.org/10.26713/jims.v4i1.64

Issue

Section

Research Articles