1660 KB39 KB121 KB3 KB2025Zhang, BoZhang, HepingZhang, Yaxianletnik:1številka:1, article p1.02str. 1-16DOI:10.26493/2820-6657.4.a42ISSN:2820-6657COBISSID_HOST:285417731URN:URN:NBN:SI:doc-RUDPHE00enUniversity of PrimorskaDiscrete mathematical chemistryconvex hexagonal systemforcing numberforcing spectrumkonveksen heksagonalni sistemperfect matchingpopolno prirejanjeprisilni spekterprisilno številoContinuous forcing spectra of perfect matchingsof convex hexagonal systems|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)Konveksen heksagonalni sistem je heksagonalni sistem, katerega notranji dualni grafi ma konveksen poligonalni rob. Prisilna množica S popolnega prirejanja M grafa G je podmnožica množice M, ki ni vsebovana v nobenem drugem popolnem prirejanju grafa G. Najmanjša kardinalnost prisilne množice prirejanja M se imenuje prisilno število prirejanja M, označimo pa ga s f(G, M). Prisilni spekter grafa G je definiran kot: Spec (G) ={f(G, M)|M je popolno prirejanje grafa G}. V tem članku pokažemo, da je za vsak konveksen heksagonalni sistem O(m, k, n) s popolnim prirejanjem njegov prisilni spekter zvezen (je celoštevilski interval)TEXTznanstveno časopisjejournalsSlovenian National E-content AggregatorNational and University Library of SloveniaUniverza na Primorskem