ON ADJACENT VERTEX DISTINGUISHING TOTAL COLORING OF THE FAMILY OF LADDER GRAPH
2018
In this paper, we present an algorithm to obtain the adjacent vertex distinguishing total coloring of the family of ladder graph. Also, we prove the existence of the adjacent vertex distinguishing total coloring of some family of ladder graph in detail.
- Correction
- Source
- Cite
- Save
- Machine Reading By IdeaReader
0
References
0
Citations
NaN
KQI