1 paper
Chengqi Li, Jinhui Yin, Lingjuan Shi
A matching of graph G is maximal if it cannot be expanded by adding any edge to create a larger matching. In this paper, for a hexagonal ring H with n hexagons, we show that…