University of Kashan Iranian Journal of Mathematical Chemistry 2228-6489 8 3 2017 09 01 Anti-forcing Number of Some Specific Graphs 313 325 49785 10.22052/ijmc.2017.60978.1235 EN S. Alikhani Yazd University, Yazd, Iran N. Soltani Yazd University Journal Article 2016 09 09 Let $G=(V,E)$ be a simple connected graph. A perfect matching (or Kekul'e structure in chemical literature) 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 <br /> their anti-forcing numbers. https://ijmc.kashanu.ac.ir/article_49785_5762b32f4d73311e1b30d195fe19f9ba.pdf