ZEDELENEBİLİRLİK ÖLÇÜMÜ OLARAK BASKINLIK
Project no. 20895 · Status: Kapanmış (Yayın bekleniyor) · 2019
Summary
Many vulnerability parameters are available in graph theory. Among these, independent and domination are the two most studied vulnerability parameters. Let D V (G). If every vertex in V (G) ?? D is adjacent to at least one vertex in the D set, then the set D is called dominating set of the graph. For S V , if no two vertices in the set S are adjacent to each other, the set S is called the independent set of the graph. In this thesis, the independent transversal domination number, recently defined as a new graph vulnerability parameter, has been studied. The independent transversal domination number of a graph G can be generally defined as the intersection of the dominating set and the independent set of the graph. For the independent transversal domination of the graph G, first independent sets are obtained. A dominating set D V (G) of a graph G is said to be an independent transversal dominating set if D intersects every maximum independent set of G and denoted by ITD-set. The independent transversal domination number of G is defined the minimum cardinality of ITD-set of G and denoted by it(G). In this study, results were obtained for the independent transversal domination values of the complementary prisms of some known graphs such as path graph, cycle graph, complete graph, star graph, wheel graph, complete bipartite graph from graphs, which are widely used as network models.