ON NEIGHBORHOOD POLYNOMIAL OF G \circ H
A subset of is a neighborhood of if can be represented as the union of the induced subgraphs of the closed neighborhoods of each vertex in . Moreover, the neighborhood number denoted by is the minimum cardinality of the neighborhood set of . The neighborhood polynomial of a graph of order is defined as . In this paper, we obtain the neighborhood polynomial of .
Authors
- Eva D. Benacer
- Brigette Ursula L. Pescueso
Publication Details
- Journal
- Advances and Applications in Discrete Mathematics
- Published
- 2025-05-05
- DOI
- https://doi.org/10.17654/0974165825027
- Primary Topic
- Graph Labeling and Dimension Problems
- Type
- article
- Field-Weighted Citation Impact
- 0.00