Independent Neighborhood Polynomial of the Direct and Corona Products of Trees
DOI:
https://doi.org/10.29020/nybg.ejpam.v18i3.6048Keywords:
Independent Neighborhood Polynomial, Direct product, corona productAbstract
Let G be a connected graph. We say that a given graph is a tree if every pair of vertices is connected by a unique path. The corona product of two graphs G and H is defined as the graph obtained by taking one copy of G and |V (G)| copies of H and joining the i
th vertex of G to every vertex in the ith copy of H. On the other hand, the direct product G × H is a graph such that the vertex set of G× H is the Cartesian product V (G)×V (H); and vertices (g, h) and (g′, h′) are adjacent in G×H if and only if g is adjacent to g′ in G, and h is adjacent to h′in H.
Downloads
Published
Issue
Section
License
Copyright (c) 2025 Normalah Sharief Abdulcarim, 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.