On permutation labeling | ||
Journal of the Egyptian Mathematical Society | ||
Volume 19, Issue 3, September 2011, Pages 134-136 PDF (317.49 K) | ||
DOI: 10.1016/j.joems.2011.10.006 | ||
Authors | ||
M. A. Seoud* ; M. A. Salim | ||
Department of Mathematics, Faculty of Science, Ain Shams University, Abbassia, Cairo, Egypt | ||
Abstract | ||
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’’. | ||
Statistics Article View: 26 PDF Download: 25 |