Single coronoid systems with an anti-forcing edge

Abstract An edge of a graph G is called an anti-forcing edge (or forcing single edge) if G has a unique perfect matching not containing this edge. It has been known for two decades that a hexagonal system has an anti-forcing edge if and only if it is a truncated parallelogram. A connected subgraph G of a hexagonal system is called a single coronoid system if G has exactly one non-hexagonal interior face and each edge belongs to a hexagon of G . In this paper, we show that a single coronoid system with an anti-forcing edge can be obtained by gluing a truncated parallelogram with a generalized hexagonal system which has a unique perfect matching and can be obtained by attaching two additional pendant edges to a hexagonal system, and the latter can be constructed from one hexagon case by applying five modes of hexagon addition. Such graphs are half essentially disconnected coronoid systems in the rheo classification. So computing the number of perfect matchings of such graphs is reduced to that of two hexagonal systems.

[1]  C. Rongsi,et al.  Regular coronoid systems , 1997 .

[2]  M. Randic,et al.  Innate degree of freedom of a graph , 1987 .

[3]  H. C. Longuet-Higgins,et al.  The correspondence between the resonance and molecular orbital theories , 1952, Proceedings of the Royal Society of London. Series A. Mathematical and Physical Sciences.

[4]  Li Xueliang,et al.  Forcing bonds of a benzenoid system , 1996 .

[5]  Heping Zhang,et al.  Anti-forcing numbers of perfect matchings of graphs , 2014, Discret. Appl. Math..

[6]  Heping Zhang,et al.  Normal Components, Kekulé Patterns, and Clar Patterns in Plane Bipartite Graphs , 2002 .

[7]  Heping Zhang,et al.  On the Anti-Forcing Number of Fullerene Graphs , 2015 .

[8]  Heping Zhang,et al.  The Rotation Graphs of Perfect Matchings of Plane Bipartite Graphs , 1997, Discret. Appl. Math..

[9]  Fuji Zhang,et al.  Coronoid systems with fixed bonds , 1997 .

[10]  Nenad Trinajstić,et al.  On the anti-Kekulé number and anti-forcing number of cata-condensed benzenoids , 2008 .

[11]  Xueliang Li.  Hexagonal Systems with Forcing Single Edges , 1997, Discret. Appl. Math..

[12]  Rong-si Chen.  Coronoid Systems with Perfect Matchings , 1996, Discret. Appl. Math..

[13]  Horst Sachs,et al.  Perfect matchings in hexagonal systems , 1984, Comb..

[14]  Heping Zhang,et al.  Spectrum of Matching Forcing Numbers of a Hexagonal System with a Forcing Edge , 2015 .

[15]  Pierre Hansen,et al.  Bonds Fixed by Fixing Bonds , 1993, J. Chem. Inf. Comput. Sci..

[16]  Gary W. Atkinson,et al.  A min-max theorem for plane bipartite graphs , 2010, Discret. Appl. Math..

[17]  Heping Zhang,et al.  Forcing matching numbers of fullerene graphs , 2010, Discret. Appl. Math..

[18]  N. Trinajstic,et al.  On the Anti-forcing Number of Benzenoids , 2007 .

[19]  Heping Zhang,et al.  A Note on the Number of Perfect Matchings of Bipartite Graphs , 1997, Discret. Appl. Math..

[20]  Xueliang Li,et al.  Hexagonal systems with forcing edges , 1995, Discret. Math..

[21]  F. Harary,et al.  Graphical properties of polyhexes: Perfect matching vector and forcing , 1991 .