Lupa

Show document Help

A- | A+ | Print
Title:Continuous forcing spectra of perfect matchingsof convex hexagonal systems
Authors:ID Zhang, Bo (Author)
ID Zhang, Yaxian (Author)
ID Zhang, Heping (Author)
Files:.pdf ZUP_Zhang_Bo_2025.pdf (1,62 MB)
MD5: F77B1AE8D13FBA6A67F6CA9211860379
 
URL https://dmc-journal.eu/index.php/dmc/article/view/4/3
 
Language:English
Work type:Unknown
Organization:ZUP - University of Primorska Press
Abstract: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).
Keywords:convex hexagonal system, perfect matching, forcing number, forcing spectrum
Publication status:Published
Publication version:Version of Record
Place of publishing:Koper
Publisher:University of Primorska
Year of publishing:2025
Number of pages:str. 1-16
Numbering:Vol. 1, no. 1, [article no. ] P1.02
PID:20.500.12556/RUP-23364 This link opens in a new window
UDC:51
ISSN on article:2820-6657
DOI:10.26493/2820-6657.4.a42 This link opens in a new window
COBISS.SI-ID:285417731 This link opens in a new window
Publication date in RUP:27.07.2026
Views:22
Downloads:0
Metadata:XML DC-XML DC-RDF
:
Copy citation
  
Average score:(0 votes)
Your score:Voting is allowed only for logged in users.
Share:Bookmark and Share


Hover the mouse pointer over a document title to show the abstract or click on the title to get all document metadata.

Record is a part of a journal

Title:Discrete mathematical chemistry
Publisher:University of Primorska
ISSN:2820-6657
COBISS.SI-ID:109303555 This link opens in a new window

Document is financed by a project

Funder:NSFC - National Natural Science Foundation of China

Licences

License:CC BY 4.0, Creative Commons Attribution 4.0 International
Link:http://creativecommons.org/licenses/by/4.0/
Description:This is the standard Creative Commons license that gives others maximum freedom to do what they want with the work as long as they credit the author.

Secondary language

Language:Slovenian
Title:Zvezni prisilni spektri popolnih prirejanj v konveksnih heksagonalnih sistemih
Abstract: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).
Keywords:konveksen heksagonalni sistem, popolno prirejanje, prisilno število, prisilni spekter


Comments

Leave comment

You must log in to leave a comment.

Comments (0)
0 - 0 / 0
 
There are no comments!

Back
Logos of partners University of Maribor University of Ljubljana University of Primorska University of Nova Gorica