Further characterization of induced paired domination number of a graph

AUTHOR AND
AFFILIATION

G. MAHADEVAN1, A. NAGARAJAN2, A. RAJESWARI3 and SELVAM AVADAYAPPAN4

KEYWORDS:

Paired domination number, Chromatic number

Issue Date:

April 2013

Pages:

ISSN:

2319-8044 (Online) – 2231-346X (Print)

Source:

Vol.25 – No.1

PDF

Click Here Download PDF

DOI:

jusps-A

ABSTRACT:

A set S  V is a induced -paired dominating set if S is a dominating set of G and the induced subgraph is a perfect matching. The induced – paired domination number ip(G) is the minimum cardinality taken over all 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 (G). The authors4characterized the classes of graphs whose sum of induced paired domination number and chromatic number equals to 2n 6, for any n  4.

In this paper we extend the above result and characterize the classes of all graphs whose sum of induced paired domination number and chromatic number equals to 2n – 7, for any n  4.

Copy the following to cite this Article:

G. MAHADEVAN1, A. NAGARAJAN2, A. RAJESWARI3 and SELVAM AVADAYAPPAN4, “Further characterization of induced paired domination number of a graph”, Journal of Ultra Scientist of Physical Sciences, Volume 25, Issue 1, Page Number , 2016


Copy the following to cite this URL:

G. MAHADEVAN1, A. NAGARAJAN2, A. RAJESWARI3 and SELVAM AVADAYAPPAN4, “Further characterization of induced paired domination number of a graph”, Journal of Ultra Scientist of Physical Sciences, Volume 25, Issue 1, Page Number , 2016

Available from: http://www.ultrascientist.org/paper/267/


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 perfect matching. The induced – paired domination number ip(G) is the minimum cardinality taken over all 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 (G). The authors4characterized the classes of graphs whose sum of induced paired domination number and chromatic number equals to 2n 6, for any n  4.

In this paper we extend the above result and characterize the classes of all graphs whose sum of induced paired domination number and chromatic number equals to 2n – 7, for any n  4.