A New Characterization of Paired Domination Number of a Graph

Dimensions

Mahadevan, G. and Nagarajan, A. and Selvam, A. and Rajeswari, A. (2012) A New Characterization of Paired Domination Number of a Graph. In: UNSPECIFIED UNSPECIFIED, pp. 86-96.

Full text not available from this repository.

Abstract

This paper characterizes graphs whose sum of paired domination number and chromatic number equals 2n - 7 for n ≥ 4. Paired domination requires selecting guards as adjacent vertex pairs with perfect matching in the induced subgraph, while chromatic number ensures adjacent vertices receive different colors. © 2012 Springer-Verlag. © 2012 Elsevier B.V., All rights reserved.

Item Type: Book Section
Subjects: Mathematics > Discrete Mathematics and Combinatorics
Divisions: Arts and Science > School of Arts and Science, Chennai > Mathematics
Depositing User: Unnamed user with email techsupport@mosys.org
Last Modified: 10 Dec 2025 06:56
URI: https://vmuir.mosys.org/id/eprint/4268

Actions (login required)

View Item
View Item