Browsing by Author "SUNDARESWARAN, Raman"

Now showing 1 - 1 of 1
  • No Thumbnail Available
    Item
    Dominator semi strong color partition in graphs
    (Ankara Üniversitesi, 2022) SUNDARESWARAN, Raman; Other; Other
    Let G =(V,E) be a simple graph. A subset S is said to be Semi-Strong if for every vertex v in V, |N(v)∩S|≤1, or no two vertices of S have the same neighbour in V, that is, no two vertices of S are joined by a path of length two in V. The minimum cardinality of a semi-strong partition of G is called the semi-strong chromatic number of G and is denoted by χsG. A proper colour partition is called a dominator colour partition if every vertex dominates some colour class, that is , every vertex is adjacent with every element of some colour class. In this paper, instead of proper colour partition, semi-strong colour partition is considered and every vertex is adjacent to some class of the semi-strong colour partition.Several interesting results are obtained.