Total Dominator Coloring on the Queen\u27s graph

Abstract

A chess board of size m x n can be translated to a Queen\u27s graph in which vertices are adjacent if their squares on the board are in the same row, column, or diagonal. In this research, the total dominator coloring of a Queen\u27s graph is explored, yielding a conjecture for the general m x n case

    Similar works