Affiliation:
1. Shrimati Indira Gandhi College
2. Ramanujan Research Center in Mathematics, Saraswathi Narayanan College
3. Sri Sivasubramaniya Nadar College of Engineering
Abstract
Let GG =(V,E)(V,E) be a simple graph. A subset SS is said to be Semi-Strong if for every vertex vv in VV, |N(v)∩S|≤1|N(v)∩S|≤1, or no two vertices of SS have the same neighbour in VV, that is, no two vertices of SS are joined by a path of length two in VV. The minimum cardinality of a semi-strong partition of GG is called the semi-strong chromatic number of GG and is denoted by χsGχ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.
Publisher
Communications Faculty of Sciences University of Ankara Series A1 Mathematics and Statistics
Reference21 articles.
1. Arumugam, S., Bagga, J., Chandrasekar, K.R., On dominator colorings in graphs, Proc. Indian Acad. Sci. (Math Sci.), 122(4) (2012), 561–578.
2. Berge, C., Graphs and Hyper Graphs, North Holland, Amsterdam, 1973.
3. Chartrand, G., Salehi, E., Zhang, P., The partition dimension of a graph, Aequationes Math., 59 (2000), 45-54. https://doi.org/10.1007/PL00000127
4. Chellali, M., Maffray, F., Dominator colorings in some classes of graphs, Graphs and Combinatorics, 28 (2012), 97–107. https://doi.org/10.1007/s00373-010-1012-z
5. Chitra, S., Gokilamani and Swaminathan, V., Color Class Domination in Graphs, Mathematical and Experimental Physics, Narosa Publishing House, 2010, 24–28.