Progress in Adjacent Vertex Distinguishing (Avd) Edge Colouring of Permutation Graphs

Suparna Jana
2015 Progress in Nonlinear Dynamics and Chaos   unpublished
A graph G=(V,E) with vertex set on N, the set of natural numbers is called a permutation graph if there exists a permutation = {(1),(2),...,(n)} on N such that for i,j ϵ N, such that either i-1 (j) or i >j and-1 (i)<-1 (j) where-1 (i) is the element of N which maps into i. Adjacent vertex distinguishing edge coloring (avd edge colouring in short) applied on different type of permutation graphs. Some theorems of avd edge colouring on permutation graphs and their proofs are established.
fatcat:3rznxfiz7bhkle4vwsj5sllavq