Mar 1, 1994 · This article is cited by 4 publications. Erika Bérczi-Kovács, András Frank. A network flow approach to a common generalization of Clar and ...
poly hex is obtained by merging these hexagons in such a way that two hexagons are either disjoint or have exactly one edge.
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 ...
Missing: Numerical | Show results with:Numerical
Numerical Bounds for the Perfect Matching Vectors of a Polyhex. 1994, 792671. Click here to go back to the BANKS homepage. About BANKS - Help - People ...
Feb 8, 2021 · We present an upper bound on the complete forcing numbers of hexagonal systems in terms of elementary edge-cut cover and two lower bounds by the ...
Missing: Numerical | Show results with:Numerical
A perfect matching of G is a set of disjoint edges of G that covers all vertices of G, which coincides with a Kekulé structure of some molecular graph (for ...
Mar 31, 2016 · We define the anti-forcing number of a perfect matching of a graph as the minimal number of edges of whose deletion results in a subgraph with a unique perfect ...
Missing: Numerical | Show results with:Numerical
Discrete Mathematical Chemistry, DIMACS Series in Discrete Mathematics and ... Numerical Bounds for the Perfect Matching Vectors of a. Polyhex, J. Chem. Inf ...
Feb 26, 2009 · [20] P. Hansen, M. Zheng, Numerical bounds for the perfect matching vectors of a polyhex, J. Chem. Inf. Comput. Sci. 34 ...
Sep 22, 2020 · In this paper we show that for every perfect matching M of a hexagonal system H with the maximum anti-forcing number or minus one, af(H, M) ...
Missing: Numerical | Show results with:Numerical