التفاصيل البيبلوغرافية
| العنوان: |
Complete Forcing Numbers of Random Multiple Hexagonal Chains |
| المؤلفون: |
Shuting Xue (11641130), Hong Bian (1671412), Lina Wei (10836093), Haizheng Yu (11641133), Shou-Jun Xu (11641136) |
| سنة النشر: |
2021 |
| المجموعة: |
Smithsonian Institution: Digital Repository |
| مصطلحات موضوعية: |
Biophysics, Medicine, Microbiology, Cell Biology, Physiology, Developmental Biology, Cancer, Plasma Physics, Computational Biology, Physical Sciences not elsewhere classified, Forcing set, complete forcing set, perfect matching, random multiple hexagonal chains |
| الوصف: |
Let G be a simple connected graph with vertex set V ( G ) and edge set E ( G ) that admits a perfect matching M . A forcing set of M is a subset of M contained in no other perfect matchings of G . The minimum cardinality of forcing sets is the forcing number of M . A complete forcing set of G , recently introduced by Xu et al. [Complete forcing numbers of catacondensed hexagonal systems, J . Combin . Optim . 29(4) (2015) 803-814], is a subset S of E ( G ) on which the restriction of any perfect matching M of G is a forcing set of M . A complete forcing set of the smallest cardinality is called a minimum complete forcing set, and its cardinality is the complete forcing number of G , denoted by cf ( G ). In this paper, we present the complete forcing sets and complete forcing number of random multiple hexagonal chains. |
| نوع الوثيقة: |
dataset |
| اللغة: |
unknown |
| العلاقة: |
https://figshare.com/articles/dataset/Complete_Forcing_Numbers_of_Random_Multiple_Hexagonal_Chains/16923131Test |
| DOI: |
10.6084/m9.figshare.16923131.v1 |
| الإتاحة: |
https://doi.org/10.6084/m9.figshare.16923131.v1Test |
| حقوق: |
CC BY 4.0 |
| رقم الانضمام: |
edsbas.DD521358 |
| قاعدة البيانات: |
BASE |
