Cited By
View all- He XZhang H(2023)Complete forcing numbers of complete and almost-complete multipartite graphsJournal of Combinatorial Optimization10.1007/s10878-023-01078-746:2Online publication date: 24-Aug-2023
Relations between global forcing number and maximum anti-forcing number of a graph
References
[1]
Balas E., Integer and fractional matchings, in: Hansen P. (Ed.), Studies on Graphs and Discrete Programming, in: Math. Stud., vol. 59, North Holland, 1981, pp. 1–13.
[2]
Cai J., Zhang H., Global forcing number of some chemical graphs, MATCH Commun. Math. Comput. Chem. 67 (2012) 289–312.
[3]
Chen G., Feng X., Lu F., Zhang L., Disjoint odd cycles in cubic solid bricks, SIAM J. Discrete Math. 33 (2019) 393–397.
[4]
De Carvalho M.H., Kothari N., Wang X., Lin Y., Birkhoff–Von Neumann graphs that are PM-compact, SIAM J. Discrete Math. 34 (2020) 1769–1790.
[5]
de Carvalho M.H., Lucchesi C.L., Murty U.S.R., On a conjecture of lovász concerning bricks, I. the characteristic of a matching covered graph, J. Combin. Theory Ser. B 85 (2002) 94–136.
[6]
de Carvalho M.H., Lucchesi C.L., Murty U.S.R., The perfect matching polytope and solid bricks, J. Combin. Theory Ser. B 92 (2004) 319–324.
[7]
de Carvalho M.H., Lucchesi C.L., Murty U.S.R., How to build a brick, Discrete Math. 306 (2006) 2383–2410.
[8]
de Carvalho M.H., Lucchesi C.L., Murty U.S.R., A generalization of Little’s theorem on Pfaffian orientations, J. Combin. Theory Ser. B 102 (2012) 1241–1266.
[9]
K. Deng, Private Communication.
[10]
Deng K., Zhang H., Anti-forcing spectra of perfect matchings of graphs, J. Comb. Optim. 33 (2017) 660–680.
[11]
Deng K., Zhang H., Extremal anti-forcing numbers of perfect matchings of graphs, Discrete Appl. Math. 224 (2017) 69–79.
[12]
Diwan A.A., The minimum forcing number of perfect matchings in the hypercube, Discrete Math. 342 (2019) 1060–1062.
[13]
Došlić T., Global forcing number of benzenoid graphs, J. Math. Chem. 41 (2007) 217–229.
[14]
Edmonds J., Maximum matching and a polyhedron with (0, 1) vertices, J. Res. Nat. Bur. Stand. B 69 (1965) 125–130.
[15]
Edmonds J., Lovász L., Pulleyblank W.R., Brick decomposition and the matching rank of graphs, Combinatorica 2 (1982) 247–274.
[16]
Harary F., Klein D.J., Živković T.P., Graphical properties of polyhexes: perfect matching vector and forcing, J. Math. Chem. 6 (1991) 295–306.
[17]
Kawarabayashi K., Ozeki K., A simpler proof for the two disjoint odd cycles theorem, J. Combin. Theory Ser. B 103 (2013) 313–319.
[18]
Klein D.J., Randić M., Innate degree of freedom of a graph, J. Comput. Chem. 8 (1987) 516–521.
[19]
Klein D.J., Rosenfeld V., Forcing, freedom, and uniqueness in graph theory and chemistry, Croat. Chem. Acta 87 (2014) 49–59.
[20]
Kotzig A., On the theory of finite graphs with a linear factor II, Mat.-Fyz. časopis Slovensk. akad. vied, 1959, pp. 136–159. (Slovak).
[21]
Lei H., Yeh Y.-N., Zhang H., Anti-forcing numbers of perfect matchings of graphs, Discrete Appl. Math. 202 (2016) 95–105.
[22]
Li X., Hexagonal systems with forcing single edges, Discrete Appl. Math. 72 (1997) 295–301.
[23]
Liu X., Xu S., Tu L., Global forcing numbers of handgun-shaped benzenoid systems, Curr. Nanosci. 10 (2014) 766–771.
[24]
Lovász L., Matching structure and the matching lattice, J. Combin. Theory Ser. B 43 (1987) 187–222.
[25]
Lovász L., Plummer M.D., Matching theory, in: Ann. Discrete Math. Vol. 29, North-Holland, Amsterdam, 1986.
[26]
Lucchesi C.L., de Carvalho M.H., Kothari N., Murty U.S.R., On two unsolved problems concerning matching covered graphs, SIAM J. Discrete Math. 32 (2018) 1478–1504.
[27]
Pachter L., Kim P., Forcing matchings on square grids, Discrete Math. 190 (1998) 287–294.
[28]
Riddle M.E., The minimum forcing number for the torus and hypercube, Discrete Math. 245 (2002) 283–292.
[29]
Sedlar J., The global forcing number of the parallelogram polyhex, Discrete Appl. Math. 160 (2012) 2306–2313.
[30]
Shi L., Wang H., Zhang H., On the maximum forcing and anti-forcing numbers of (4, 6)-fullerenes, Discrete Appl. Math. 233 (2017) 187–194.
[31]
Shi L., Zhang H., Tight upper bound on the maximum anti-forcing numbers of graphs, Discrete Math. Theor. Comput. Sci. 19 (2017) 9–15.
[32]
Vukičević D., Doslić T., Global forcing number of grid graphs, Australas. J. Combin. 38 (2007) 47–62.
[33]
Vukičević D., Sedlar J., Total forcing number of the triangular grid, Math. Commun. 9 (2004) 169–179.
[34]
Vukičević D., Trinajstić N., On the anti-forcing number of benzenoids, J. Math. Chem. 42 (2007) 575–583.
[35]
Vukičević D., Trinajstić N., On the anti-kekulé number and anti-forcing number of cata-condensed bezenoids, J. Math. Chem. 43 (2008) 719–726.
[36]
Xu L., Bian H., Zhang F., Maximum forcing number of hexagonal systems, MATCH Commun. Math. Comput. Chem. 70 (2013) 493–500.
[37]
Zhang H., Cai J., On the global forcing number of hexagonal systems, Discrete Appl. Math. 162 (2014) 334–347.
[38]
Zhang H., Zhou X., A maximum resonant set of polyomino graphs, Discuss. Math. Graph Theory 36 (2) (2016) 323–337.
[39]
Zhou X., Zhang H., Clar sets and maximum forcing numbers of hexagonal systems, MATCH Commun. Math. Comput. Chem. 74 (2015) 161–174.
[40]
Zhou X., Zhang H., A minimax result for perfect matchings of a polyomino graph, Discrete Appl. Math. 206 (2016) 165–171.
Index Terms
- Relations between global forcing number and maximum anti-forcing number of a graph
Index terms have been assigned to the content through auto-classification.
Recommendations
Anti-forcing numbers of perfect matchings of graphs
We define the anti-forcing number of a perfect matching M of a graph G as the minimal number of edges of G whose deletion results in a subgraph with a unique perfect matching M , denoted by a f ( G , M ) . The anti-forcing number of a graph proposed by ...
The upper connected geodetic number and forcing connected geodetic number of a graph
For a connected graph G of order p>=2, a set S@__ __V(G) is a geodetic set of G if each vertex v@__ __V(G) lies on an x-y geodesic for some elements x and y in S. The minimum cardinality of a geodetic set of G is defined as the geodetic number of G, ...
Extremal anti-forcing numbers of perfect matchings of graphs
The anti-forcing number of a perfect matching M of a graph G is the minimal number of edges not in M whose removal to make M as a unique perfect matching of the resulting graph. The set of anti-forcing numbers of all perfect matchings of G is the anti-...
Comments
Information & Contributors
Information
Published In
Elsevier B.V.
Publisher
Elsevier Science Publishers B. V.
Netherlands
Publication History
Published: 15 April 2022
Author Tags
Qualifiers
- Research-article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- View Citations1Total Citations
- 0Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0
Reflects downloads up to 04 Feb 2025
Other Metrics
Citations
Cited By
View all- He XZhang H(2023)Complete forcing numbers of complete and almost-complete multipartite graphsJournal of Combinatorial Optimization10.1007/s10878-023-01078-746:2Online publication date: 24-Aug-2023