Convex Independent Neighborhood Polynomial of Some Special Graphs
DOI:
https://doi.org/10.29020/nybg.ejpam.v18i2.5978Keywords:
convex sets, convex subgraph, independent neighborhood system, independent set, convex independent neighborhood polynomialAbstract
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.
Downloads
Published
Issue
Section
License
Copyright (c) 2025 Edison John Aguilon, Rosalio G. Artes Jr., Susan C. Dagondon

This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.
Upon acceptance of an article by the European Journal of Pure and Applied Mathematics, the author(s) retain the copyright to the article. However, by submitting your work, you agree that the article will be published under the Creative Commons Attribution-NonCommercial 4.0 International License (CC BY-NC 4.0). This license allows others to copy, distribute, and adapt your work, provided proper attribution is given to the original author(s) and source. However, the work cannot be used for commercial purposes.
By agreeing to this statement, you acknowledge that:
- You retain full copyright over your work.
- The European Journal of Pure and Applied Mathematics will publish your work under the Creative Commons Attribution-NonCommercial 4.0 International License (CC BY-NC 4.0).
- This license allows others to use and share your work for non-commercial purposes, provided they give appropriate credit to the original author(s) and source.