• 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.