Name
Abstract | ||
|---|---|---|
Let G be a (4,6)-fullerene graph. We show that the maximum forcing number of G is equal to its Clar number, and the maximum anti-forcing number of G is equal to its Fries number, which extend the known results for hexagonal systems with a perfect matching (Xu etal., 2013; Lei etal., 2016). Moreover, we obtain two formulas dependent only on the order of G to count the Clar number and Fries number of G respectively. Hence we can compute the maximum forcing number of a (4,6)-fullerene graph in linear time. This answers an open problem proposed by Afshani etal. (2004) in the case of (4,6)-fullerene graphs. |
Year | DOI | Venue |
|---|---|---|
2017 | 10.1016/j.dam.2017.07.009 | Discrete Applied Mathematics |
Keywords | Field | DocType |
(4, 6)-fullerene,Perfect matching,Forcing number,Anti-forcing number | Discrete mathematics,Graph,Combinatorics,Open problem,Hexagonal crystal system,Matching (graph theory),Forcing (mathematics),Time complexity,Fullerene,Mathematics | Journal |
Volume | Issue | ISSN |
233 | C | 0166-218X |
Citations | PageRank | References |
2 | 0.39 | 10 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Lingjuan Shi | 1 | 2 | 0.73 |
| hongwei wang | 2 | 36 | 8.68 |
| Heping Zhang | 3 | 6 | 2.13 |