Resonance in elemental benzenoids
Discrete Applied Mathematics - Special volume on chemistry and discrete mathematics
Hexagonal systems with forcing single edges
Discrete Applied Mathematics
Forcing matchings on square grids
Discrete Mathematics
Plane elementary bipartite graphs
Discrete Applied Mathematics
The minimum forcing number for the torus and hypercube
Discrete Mathematics
Theoretical Computer Science - Special issue: Tilings of the plane
On the global forcing number of hexagonal systems
Discrete Applied Mathematics
| Hi-index | 0.04 |
A global forcing set in a simple connected graph G with a perfect matching is any subset S of E(G) such that the restriction of the characteristic function of perfect matchings of G on S is an injection. The number of edges in a global forcing set of the smallest cardinality is called the global forcing number of G. In this paper we prove that for a parallelogram polyhex with m rows and n columns of hexagons (m@?n) the global forcing number equals m(n+1)/2 if m is even, and n(m+1)/2 if m is odd. Also, we provide an example of a minimum global forcing set.