Continuous forcing spectra of perfect matchingsof convex hexagonal systemsZhang, Bo (Avtor) Zhang, Yaxian (Avtor) Zhang, Heping (Avtor) convex hexagonal systemperfect matchingforcing numberforcing spectrumA convex hexagonal system is a hexagonal system whose inner dual graph has a convex polygonal boundary. A forcing set S for a perfect matching M of a graph G is a subset of M that is contained in no other perfect matchings of G. The smallest cardinality of a forcing set of M is called the forcing number of M, denoted by f (G, M). The forcing spectrum of G is defined as: Spec(G) ={f(G, M)|M is a perfect matching of G}. In this paper, we show that for any convex hexagonal system O(m, k, n) with a perfect matching, it s forcing spectrum is continuous (or an integer interval).University of Primorska20252026-07-27 11:08:32Neznano23364UDK: 51ISSN pri članku: 2820-6657DOI: 10.26493/2820-6657.4.a42COBISS.SI-ID: 285417731sl