3-sequent achromatic sum of graphs Academic Article in Scopus uri icon

abstract

  • © 2021 World Scientific Publishing Company.Three vertices x,y,z in a graph G are said to be 3-sequent if xy and yz are adjacent edges in G. A 3-sequent coloring (3s coloring) is a function ¿: V (G) ¿{1, 2,¿,k} such that if x,y and z are 3-sequent vertices, then either ¿(x) = ¿(y) or ¿(y) = ¿(z) (or both). The 3-sequent achromatic number of a graph G, denoted ¿3s(G), equals the maximum number of colors that can be used in a coloring of the vertices' of G such that if xy and yz are any two sequent edges in G, then either x or z is colored the same as y. The 3-sequent achromatic sum of a graph G, denoted ¿3s(G), is the greatest sum of colors among all proper 3s-coloring that requires ¿3s(G) colors. This research initiates the study of 3-sequent achromatic sum and finds the exact values of this parameter for some known graphs. Furthermore, we calculate the ¿3s(G) of corona product, Cartesian product of the graphs and some important results have been proved and a comparative study is carried out.

publication date

  • August 1, 2021