On forcing matching number of boron-nitrogen fullerene graphs

@article{Jiang2011OnFM,
  title={On forcing matching number of boron-nitrogen fullerene graphs},
  author={Xiaoyan Jiang and Heping Zhang},
  journal={Discrete Applied Mathematics},
  year={2011},
  volume={159},
  pages={1581-1593}
}
1582 X. Jiang, H. Zhang / Discrete Applied Mathematics 159 (2011) 1581–1593 5-layer 1-layer 3layer traversed edge Fig. 1. Illustration for T3 in T , layer and traversed edge. many fullerene graphs. Li [12] obtained that the forcing spectrum of Cartesian product C3 × P2n is the integer interval:  n −  n 3  , 2n  . In recent years, a related concept-global forcing number, which is the smallest cardinality of subsets of edges that can distinguish all perfect matchings of a graph, was proposed… CONTINUE READING

References

Publications referenced by this paper.
SHOWING 1-10 OF 25 REFERENCES

Spectrum of matching forcing numbers of graph K3 × P2n

  • C. Li
  • Preprint
  • 2008
1 Excerpt

The forcing number of toroidal polyhexes

  • H. Wang, D. Ye, H. Zhang
  • J. Math. Chem. 43
  • 2008
1 Excerpt

Global forcing number of benzenoid graphs

  • T. Došlić
  • J. Math. Chem. 41
  • 2007
1 Excerpt

On the spectrum of the forcing matching number of graphs , Australas

  • H. Hatami P. Afshani, E. S. Mahmoodian
  • J . Combin
  • 2004

Total forcing number of the triangular grid

  • D. Vukičević, J. Sedlar
  • Math. Commun. 9
  • 2004
1 Excerpt

Similar Papers

Loading similar papers…