Neighborhood connected perfect domination in graphs | Zendy

Kulandai Vel | Zendy; P. Selvaraju | Zendy; C. Sivagnanam | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Neighborhood connected perfect domination in graphs

Author(s) -

Kulandai Vel,

P. Selvaraju,

C. Sivagnanam

Publication year - 2012

Publication title -

tamkang journal of mathematics

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.324

H-Index - 18

eISSN - 0049-2930

pISSN - 2073-9826

DOI - 10.5556/j.tkjm.43.2012.839

Subject(s) - dominating set , mathematics , combinatorics , vertex (graph theory) , vertex connectivity , connected dominating set , domination analysis , induced subgraph , distance hereditary graph , graph , connectivity , set (abstract data type) , discrete mathematics , line graph , computer science , graph power , programming language

Let $G = (V, E)$ be a connected graph. A set $S$ of vertices in $G$ is a perfect dominating set if every vertex $v$ in $V-S$ is adjacent to exactly one vertex in $S$. A perfect dominating set $S$ is said to be a neighborhood connected perfect dominating set (ncpd-set) if the induced subgraph $$ is connected. The minimum cardinality of a ncpd-set of $G$ is called the neighborhood connected perfect domination number of $G$ and is denoted by $gamma_{ncp}(G)$. In this paper we initiate a study of this parameter

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research