ARTICLE
TITLE

On adjacent vertex distinguishing total coloring of quadrilateral snake

SUMMARY

In this paper, we prove the existence of the adjacent vertex distinguishing total coloringnof quadrilateral snake, double quadrilateral snake, alternate quadrilateral snake and double alternate quadrilateral snake in detail. Also, we present an algorithm to obtain the adjacent vertex distinguishing total coloring of these quadrilateral graph family. The minimum number of colors required to give an adjacent vertex distinguishing total coloring (abbreviated as AVDTC) to the graph G is denoted by avt(G).

 Articles related

Luis A. Dupont,Daniel G. Mendoza,Miriam Rodriguez    

Let G be a finite group. The enhanced power graph GGe of G is the graph with vertex set G and two distinct vertices are adjacent if they generate a cyclic subgroup of G. In this article, we calculate the rainbow co... see more


Rian Febrian Umbara,A.N.M. Salman,Pritta Etriana Putri    

A rainbow path in an edge-colored graph G is a path that every two edges have different colors. The minimum number of colors needed to color the edges of G such that every two distinct vertices are connected by a rainbow path is calle... see more


Risma Yulina Wulandari,Rinovia Simanjuntak    

A graph G is distance antimagic if there is a bijection f : V(G)?{1, 2, …, |V(G)|} such that for every pair of distinct vertices x and y applies w(x)?w(y), where w(x)=S z ? N(x)f(z) and N(x... see more


Pannawat Eakawinrujee,Nantapath Trakultraipruk    

A paired dominating set of a graph G is a dominating set whose induced subgraph has a perfect matching. The paired domination number ?pr(G) of G is the minimum cardinality of a paired dominating set. A paired dominating set&... see more


Liang Dong, Zhishui Hu    

Random intersection graphs are models of random graphs in which each vertex is assigned a subset of objects independently and two vertices are adjacent if their assigned subsets are adjacent. Let nn and m=[ßna]m=[\beta n^{\alpha}] denote the number of ve... see more