• NEIGHBORHOOD SETS AND NEIGHBORHOOD POLYNOMIAL OF A PATH
Abstract
A set S of vertices in a graph G is a neighborhood set of G if , where is the subgraph of G induced by and all vertices adjacent to. The neighborhood number of is the minimum number of vertices in a neighborhood of G [3]. Let be the family of neighborhood sets of a Path with cardinality . In this paper we construct family of neighborhood sets of Paths and its polynomial of a path.
Keywords
Neighborhood set, neighborhood number and neighborhood polynomials.
Full Text:
PDFThis work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License.
© 2010-2022 International Journal of Mathematical Archive (IJMA) Copyright Agreement & Authorship Responsibility |