Skip to content

Archives › Volume 2, Number 4 (2012)

J. Math. Comput. Sci. 2 (2012), 889–897

On the middle CN-dominating graphs

Anwar Alwardi, N.D. Soner, G. Deepak

Abstract

Let $G = (V,E)$ be a graph and $A(G)$ is the collection of all minimal CN-dominating sets of $G$. The middle CN-dominating graph of $G$ is the graph denoted by $M_{cnd}(G)$ with vertex set the disjoint union of $V \cup A(G)$ and $(u, v)$ is an edge if and only if $u \cap v \neq\phi$ whenever $u, v \in A(G)$ or $u \in v$ whenever $u \in v$ and $v \in A(G)$. In this paper, characterizations are given for graphs whose middle CN-dominating graph is connected and $K_{p}\subseteq M_{cnd}(G)$. Other properties of middle CN-dominating graphs are also obtained.

Published
31 May 2012
Volume
2 (2012)
License
CC BY 3.0

Copyright © 2012 Anwar Alwardi, N.D. Soner, G. Deepak. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Cite this article

A. Alwardi, N. D. Soner, G. Deepak, On the middle CN-dominating graphs, J. Math. Comput. Sci. 2 (2012), 889–897.

BibTeX
@article{Alwardi2012,
  author  = {Alwardi, Anwar and Soner, N.D. and Deepak, G.},
  title   = {On the middle CN-dominating graphs},
  journal = {J. Math. Comput. Sci.},
  volume  = {2},
  year    = {2012},
  pages   = {889--897},
  doi     = {}
}