Add to ORKGAbstract The anti-forcing number of a graph is the smallest number of edges that have to be removed so that the remaining graph contains only one perfect matching. In this paper, the anti-forcing number of double hexagonal chains is determined and the extremal graphs are characterized
Given a graph G, the zero forcing number of G, Z(G), is the smallest cardinality of any set S of ver...
AbstractThe forcing number or the degree of freedom of a perfect matching M of a graph G is the card...
AbstractThe concept of forcing faces of a plane bipartite graph was first introduced in Che and Chen...
AbstractIn this paper, we introduce the concept of a forcing single edge in a hexagonal system H, wh...
The global forcing number of a graph G is the minimal cardinality of an edge subset discriminating a...
Abstract“Double hexagonal chains” can be considered as benzenoids constructed by successive fusions ...
For any perfect matching M of a graph AG, the anti-forcing number of M af(G,M) is the cardinality of...
Let $G$ be a simple graph with a perfect matching. Deng and Zhang showed thatthe maximum anti-forcin...
AbstractAn edge of a hexagonal system H is said to be forcing if it belongs to exactly one perfect m...
AbstractLet G be a graph that admits a perfect matching M. A forcing set S for a perfect matching M ...
AbstractLet G be a graph that admits a perfect matching. The forcing number of a perfect matching M ...
AbstractLet Ω denote the class of connected plane bipartite graphs with no pendant edges. A finite f...
AbstractThe forcing number of a perfect matching M of a graph G is the cardinality of the smallest s...
AbstractLet G be a graph that admits a perfect matching. A forcing set for a perfect matching M of G...
AbstractLet G be a graph with a perfect matching M. The forcing number of M is the smallest number o...
Given a graph G, the zero forcing number of G, Z(G), is the smallest cardinality of any set S of ver...
AbstractThe forcing number or the degree of freedom of a perfect matching M of a graph G is the card...
AbstractThe concept of forcing faces of a plane bipartite graph was first introduced in Che and Chen...
AbstractIn this paper, we introduce the concept of a forcing single edge in a hexagonal system H, wh...
The global forcing number of a graph G is the minimal cardinality of an edge subset discriminating a...
Abstract“Double hexagonal chains” can be considered as benzenoids constructed by successive fusions ...
For any perfect matching M of a graph AG, the anti-forcing number of M af(G,M) is the cardinality of...
Let $G$ be a simple graph with a perfect matching. Deng and Zhang showed thatthe maximum anti-forcin...
AbstractAn edge of a hexagonal system H is said to be forcing if it belongs to exactly one perfect m...
AbstractLet G be a graph that admits a perfect matching M. A forcing set S for a perfect matching M ...
AbstractLet G be a graph that admits a perfect matching. The forcing number of a perfect matching M ...
AbstractLet Ω denote the class of connected plane bipartite graphs with no pendant edges. A finite f...
AbstractThe forcing number of a perfect matching M of a graph G is the cardinality of the smallest s...
AbstractLet G be a graph that admits a perfect matching. A forcing set for a perfect matching M of G...
AbstractLet G be a graph with a perfect matching M. The forcing number of M is the smallest number o...
Given a graph G, the zero forcing number of G, Z(G), is the smallest cardinality of any set S of ver...
AbstractThe forcing number or the degree of freedom of a perfect matching M of a graph G is the card...
AbstractThe concept of forcing faces of a plane bipartite graph was first introduced in Che and Chen...