Jing Tian: General position number in k-th power of graphs and maximal outerplanar graphs

Abstract. ** The vertex subset R of G is a general position set if no vertex w of R lies on any u,v-shortest path in G, where {u,v}⊆R∖{w}. The general position number (or gp-number for short) gp(G) of G is the cardinality of a largest general position set of G. In this talk, we will introduce some new results on the gp-number of k-th power graphs and maximal outerplanar graphs.