General Position Polynomials

Abstract

A subset of vertices of a graph G is a general position set if no triple of vertices from the set lie on a common shortest path in G. In this paper we introduce the general position polynomial as ∑i≥0aixi\\documentclass[12pt]{minimal} \\usepackage{amsmath} \\usepackage{wasysym} \\usepackage{amsfonts} \\usepackage{amssymb} \\usepackage{amsbsy} \\usepackage{mathrsfs} \\usepackage{upgreek} \\setlength{\\oddsidemargin}{-69pt} \\begin{document}$$\\sum _{i \\ge 0} a_i x^i$$\\end{document}, where ai\\documentclass[12pt]{minimal} \\usepackage{amsmath} \\usepackage{wasysym} \\usepackage{amsfonts} \\usepackage{amssymb} \\usepackage{amsbsy} \\usepackage{mathrsfs} \\usepackage{upgreek} \\setlength{\\oddsidemargin}{-69pt} \\begin{document}$$a_i$$\\end{document} is the number of distinct general position sets of G with cardinality i. The polynomial is considered for several well-known classes of graphs and graph operations. It is shown that the polynomial is not unimodal in general, not even on trees. On the other hand, several classes of graphs, including Kneser graphs K(n, 2), with unimodal general position polynomials are presented.