In this paper, we introduced the notion of convex independent neighborhood polynomial for a graph. We further explored the convex independent neighborhood polynomial for some special graphs such as paths, cycles, complete graphs, and star graphs. We generated these polynomials by counting the number of convex subsets of a graph with corresponding maximum independent set in the neighborhood system. [ABSTRACT FROM AUTHOR]

Copyright of European Journal of Pure & Applied Mathematics is the property of New York Business Global LLC and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)