On the Independent Neighborhood Polynomial of the Cartesian Product of Some Special Graphs
DOI:
https://doi.org/10.29020/nybg.ejpam.v14i1.3860Keywords:
Independent Neighborhood Set, Neighborhood Polynomial, Cartesian ProductAbstract
Two vertices x, y of a graph G are adjacent, or neighbors, if xy is an edge of G. A set S of vertices in a graph G is a neighborhood set if G =[v∈ShN[v]i where hN[v]i is the subgraph induced by v and all the vertices adjacent to v. If no two of the elements of S are adjacent, then S is called an independent neighborhood set. The independent neighborhood polynomial of G of order m is Ni(G, x) = Xm j=ηi(G) ni(G, j)xj where ni(G, j) is the number of independent neighborhood set of G of size j and ηi(G) is the minimum cardinality of an independent neighborhood set of G. This paper investigates the independent neighborhood polynomial of the Cartesian product of some special graphs.
Downloads
Published
Issue
Section
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.