• INDEPENDENT MAJORITY NEIGHBORHOOD POLYNOMIAL OF A GRAPH
Abstract
In this article we have introduced new polynomial Independent Majority Neighborhood polynomial of a graph G is defined as, where is the number of independent majority neighborhood sets of size and is the Independent majority neighborhood number of a graph. Also we have determined this new polynomial structure for some classes of graphs.
Keywords
Independent Majority neighborhood number, Independent Majority neighborhood polynomial.
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 |