Characterization of induced paired domination number of a graph

Author:
G. MAHADEVAN1, A. NAGARAJAN2 and A. RAJESWARI3
Affiliation:

1Department of Mathematics, Gandhigram Rural University, Gandhigram 624 302 (INDIA)
2Department of Mathematics, V.O.Chidambaram College, Tuticorin- 628 008 (INDIA)
3Department of Mathematics, Aarupadai Veedu Institute of Technology,Paiyanoor, Chennai -603 104 (INDIA)
Email: gmaha2003@yahoo.co.in , Email: nagarajan.voc@gmail.com Email: rajeswarivenket@yahoo.com

Keyword:
Induced Paired domination number, Chromatic number AMS (2010) 05C69
Issue Date:
August 2012
Abstract:

The concept of induced paired domination number of a graph was introduced by D.S.Studer, T.W. Haynes and L.M. Lawson11, with the following application in mind. In the guard application an induced paired dominating set represents a configuration of security guards in which each guard is assigned one other as a designated backup with in (as in a paired dominating set), but to avoid conflicts (such as radio interference) between a guard and his/her backup, we require that the backup each guard be unique. Since among the guards only designated partners are adjacent to each other, we reduce the possibility of conflicts in communication. A set S V is a induced -paired dominating set if S is a dominating set of G and the induced subgraph <S> is a set of independent edges. The induced - paired domination number ip(G) is the minimum cardinality taken over all induced paired dominating sets in G. The minimum number of colours required to colour all the vertices so that adjacent vertices do not receive the same colour and is denoted by . Mahadevan3-5 G, characterized the classes of all graphs whose sum of induced paired domination number and chromatic number of order up to 2n 5. In this paper we characterize the classes of all graphs whose sum
of induced paired domination number and chromatic number equals to 2n 6, for any n  4.

Pages:
ISSN:
2319-8044 (Online) - 2231-346X (Print)
Source:
DOI:
Share This:
Facebook Twitter Google Plus LinkedIn Reddit

Copy the following to cite this article:

G. MAHADEVAN1, A. NAGARAJAN2 and A. RAJESWARI3, "Characterization of induced paired domination number of a graph", Journal of Ultra Scientist of Physical Sciences, Volume 24, Issue 2, Page Number , 2016

Copy the following to cite this URL:

G. MAHADEVAN1, A. NAGARAJAN2 and A. RAJESWARI3, "Characterization of induced paired domination number of a graph", Journal of Ultra Scientist of Physical Sciences, Volume 24, Issue 2, Page Number , 2016

Available from: https://www.ultrascientist.org/paper/421/

Ansari Education And Research Society
Facebook Google Plus Twitter