The concept of coloring a graph will lead to the definition of a complete n- coloring of a graph G which results the achromatic number ψ(G) where the maximum number of colors required for the points of G in which every ...

A dominator coloring is a coloring of the vertices of a graph such that every vertex is either alone in its color class or adjacent to all vertices of at least one other color class. In this paper, we obtain the dominator ...

A vertex magic total labeling is a bijection from the union of the vertex set and edge set to the consecutive integers 1,2,3,....,v+e with the property that for every u in the vertex set, the sum of the label of u and the ...

Topological invariants are the graph theoretical tools to the theoretical chemists, that correlates the molecular structure with several chemical reactivity, physical properties or biological activity numerically. A function ...