A 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).

Rights

URN

URN:NBN:SI:doc-RUDPHE00

COBISS ID

285417731

DOI

10.26493/2820-6657.4.a42

Added

24.08.2026

Metadata

Citation

APA:

Zhang, Bo, Zhang, Yaxian, Zhang, Heping (2025). Continuous forcing spectra of perfect matchingsof convex hexagonal systems, volume 1, issue 1, article p1.02. URN:NBN:SI:doc-RUDPHE00 from http://www.dlib.si

MLA:

Zhang, Bo, Zhang, Yaxian, Zhang, Heping. Continuous forcing spectra of perfect matchingsof convex hexagonal systems. University of Primorska, 2025.
<http://www.dlib.si/?URN=URN:NBN:SI:doc-RUDPHE00>