The 2-dimensional torus networks, denoted by T (m, n), is a special case of the famous n-
dimensional torus network. The extra connectivity, structure connectivity and sub-structure …

A convex hexagonal system (CHS) is a hexagonal system whose inner dual has the convex
polygonal boundary. The minimum forcing number of a graph G is the smallest cardinality of …

The forcing number of a perfect matching M in a graph G is the smallest number of edges
inside M that can not be contained in other perfect matchings of G. The anti-forcing number …

For any perfect matching M of a graph G, the forcing number (resp. anti-forcing number) of M
is the smallest cardinality of an edge subset S⊆ M (resp. S⊆ E (G)∖ M) such that the graph …

Let G be a graph on n vertices. Denote by f (G) the minimum size of a matching M in G such
that M is uniquely extendable to a perfect matching in G. The prism of G is defined as G□ K …

Abstract A matching MM in a graph GG is semistrong if every edge of MM has an endvertex
of degree one in the subgraph induced by the vertices of M M. A semistrong edge‐coloring …

A global forcing set for maximal matchings of a graph G=(V (G), E (G)) is a set S⊆ E (G) such
that M 1∩ S≠ M 2∩ S for each pair of maximal matchings M 1 and M 2 of G. The smallest …

For any perfect matching M of a graph AG, the anti-forcing number of M af (G, M) is the
cardinality of a minimum edge subset S⊆ E (G)\M such that the graph G− S has only one …

Let $ G=(V (G), E (G)) $ be a graph with maximum degree $\Delta $. For a subset $ M $ of $
E (G) $, we denote by $ G [V (M)] $ the subgraph of $ G $ induced by the endvertices of …

The global forcing number of a graph G is the minimal cardinality of an edge subset
discriminating all perfect matchings of G, denoted by gf (G). For a perfect matching M of G …