Downloads: 112 | Views: 121
Research Paper | Mathematics | India | Volume 6 Issue 9, September 2017
New Implementation of Paired Triple Connected Domination Number of a Graph
A. Rajeswari  | G. Mahadevan
Abstract: A set S V is a paired triple connected dominating set if S is a triple connected dominating set of G and the induced subgraph has a perfect matching. The paired triple connected domination number ptc (G) is the minimum cardinality taken over all paired triple connected 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. In , Mahadevan G et. al. , characterized the classes of the graphs whose sum of paired triple connected domination number and chromatic number equals 2n 1. In this paper we characterize the classes of all graphs whose sum of paired triple connected domination number and chromatic number equals to 2n 2, 2n 3, 2n 4, for any n 5.
Keywords: Paired triple connected domination number, Chromatic number AMS 2010 05C69
Edition: Volume 6 Issue 9, September 2017,
Pages: 1213 - 1217
Similar Articles with Keyword 'triple'
Research Paper, Mathematics, India, Volume 6 Issue 4, April 2017Pages: 2513 - 2521
Concept of Pythagorean Theorems New Proof and Pythagoreans Triple with Ancient Vedic Investigation
Jas Paul Singh
Research Paper, Mathematics, India, Volume 3 Issue 12, December 2014Pages: 965 - 971
Triple Simultaneous Fourier Series Equations Involving Heat Polynomials
Gunjan Shukla  | K. C. Tripathi