• SOME NEW PERMUTATION GRAPHS
Abstract
Let G = (V, E) be a (p, q) graph. An injection f : V (G) → {1, 2, . . . , p} is called permutation labelling, if the edge values are obtained by the number of permutations of the larger vertex label taken smaller vertex label at a time are all distinct. If a graph G admits such labeling, it is called a permutation graph. In this paper we prove that cycle with one chord, cycle with twin chords,, book graph, tadpole and lotus inside a circle are permutation graphs.
Keywords
Full Text:
PDFThis work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License.
© 2010-2022 International Journal of Mathematical Archive (IJMA) Copyright Agreement & Authorship Responsibility |