We determine all permutation graphs of order 69. We prove that every bipartite graph of order 650 is a permutation graph. We convert the conjecture stating that ‘‘every tree is a permutation graph’’ to be ‘‘every bipartite graph is a permutation graph’’.
Seoud, M., & Salim, M. (2011). On permutation labeling. Journal of the Egyptian Mathematical Society, 19(3), 134-136. doi: 10.1016/j.joems.2011.10.006
MLA
M. A. Seoud; M. A. Salim. "On permutation labeling", Journal of the Egyptian Mathematical Society, 19, 3, 2011, 134-136. doi: 10.1016/j.joems.2011.10.006
HARVARD
Seoud, M., Salim, M. (2011). 'On permutation labeling', Journal of the Egyptian Mathematical Society, 19(3), pp. 134-136. doi: 10.1016/j.joems.2011.10.006
VANCOUVER
Seoud, M., Salim, M. On permutation labeling. Journal of the Egyptian Mathematical Society, 2011; 19(3): 134-136. doi: 10.1016/j.joems.2011.10.006
)
View on SCiNiTO