Anti-Forcing Number of Some Specific Graphs

Let g be a simple connected graph. a perfect matching (or kekulé structure in chemical language) of g is a set of disjoint edges which covers all vertices of g. the anti–forcing number of g is the smallest number of edges such that the remaining graph obtained by deleting these edges has a unique perfect matching and is denoted by af(g). in this paper we consider some specific graphs that are of importance in chemistry and study their anti–forcing numbers.