{"product_id":"introduction-to-restrained-triple-connected-domination-number-of-a-graph-domination-theory-graph-theory-von-bhagavathi-ammal","title":"Introduction to Restrained Triple Connected Domination Number of a Graph","description":"\u003cp\u003eThis 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 [1,2] domination number of a graph, Medium domination number of products of path and star related graph will be covered in the next volume.\u003c\/p\u003e\u003cdiv class=\"aw-variant-hidden-subtitle-div\" id=\"aw-variant-subtitle-9786200486646\"\u003e\u003ch3\u003eDomination Theory - Graph Theory\u003c\/h3\u003e\u003c\/div\u003e","brand":"Libri","offers":[{"title":"Softcover - 9786200486646","offer_id":39464585199709,"sku":"9786200486646","price":39.9,"currency_code":"EUR","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0940\/0622\/files\/afaea928-08a9-4958-ad32-599d9c9a8a47.jpg?v=1781590225","url":"https:\/\/shop.autorenwelt.de\/products\/introduction-to-restrained-triple-connected-domination-number-of-a-graph-domination-theory-graph-theory-von-bhagavathi-ammal","provider":"Autorenwelt Shop","version":"1.0","type":"link"}