Introduction to Restrained Triple Connected Domination Number of a Graph

This book is an Introduction text on Restrained Triple Connected Domination Number (RTCD) of a graph covers characterization product of graphs and generalization of any standard graphs like cycle path. It contains two chapters such that first chapter provides a basic information about RTCD set and RTCD number where as the minimum cardinality of RTCD set. It provides the complete description of graphs for which RTCD number is p – 2. It makes the availability for the characterization of cubic graphs on which RTCD number equal to the chromatic number of a graph the characterization of RTCD number and the chromatic number of a graph as well as the connectivity of a graph. And the second chapter covers the RTCD number for the product of path product of the cycle and start families of graphs. Strong and Weak triple connected a domination number of a graph Triple connected [12] domination number of a graph Medium domination number of products of path and star related graph will be covered in the next volume.