On the Number of Perfect Star Packing and Perfect Pseudo-Matching in Some Fullerene Graphs

被引：0

作者：

Taheri-Dehkordi, Meysam ^{[1
]}

Fath-Tabar, Gholam Hossein ^{[2
]}

机构：

[1] Univ Appl Sci & Technol UAST, Tehran, Iran

[2] Univ Kashan, Fac Math Sci, Dept Pure Math, Kashan 8731753153, Iran

来源：

IRANIAN JOURNAL OF MATHEMATICAL CHEMISTRY | 2023年 / 14卷 / 01期

关键词：

Fullerene graphs; Perfect star packing; Perfect pseudo-matching; PENTAGONS; LEAPFROG; PAIRS;

D O I：

10.22052/IJMC.2022.248451.1669

中图分类号：

O6 [化学];

学科分类号：

0703 ;

摘要：

A perfect star packing in a fullerene graph G is a spanning subgraph of G whose every component is isomorphic to the star graph K1,3. A perfect pseudo-matching of a fullerene graph G is a spanning subgraph H of G such that each component of H is either K2 or K1,3. In this paper, we calculate the number of perfect star packing in some (3, 6)-fullerene graphs and perfect pseudo-matching in Chamfered fullerene graphs. ⠍c 2023 University of Kashan Press. All rights reserved

引用

页码：7 / 18

页数：12

共 50 条

[1] The fullerene graphs with a perfect star packing
Shi, Lingjuan
[J]. ARS MATHEMATICA CONTEMPORANEA, 2023, 23 (01)
[2] On some graphs with a unique perfect matching
Chaplick, Steven
Fuerst, Maximilian
Maffray, Frederic
Rautenbach, Dieter
[J]. INFORMATION PROCESSING LETTERS, 2018, 139 : 60 - 63
[3] On lower bounds of number of perfect matchings in fullerene graphs
Doslic, T
[J]. JOURNAL OF MATHEMATICAL CHEMISTRY, 1998, 24 (04) : 359 - 364
[4] On lower bounds of number of perfect matchings in fullerene graphs
Tomislav Došlić
[J]. Journal of Mathematical Chemistry, 1998, 24 : 359 - 364
[5] Fractional matching preclusion number of graphs and the perfect matching polytope
Lin, Ruizhi
Zhang, Heping
[J]. JOURNAL OF COMBINATORIAL OPTIMIZATION, 2020, 39 (03) : 915 - 932
[6] Fractional matching preclusion number of graphs and the perfect matching polytope
Ruizhi Lin
Heping Zhang
[J]. Journal of Combinatorial Optimization, 2020, 39 : 915 - 932
[7] New lower bound on the number of perfect matchings in fullerene graphs
Zhang, HP
Zhang, FJ
[J]. JOURNAL OF MATHEMATICAL CHEMISTRY, 2001, 30 (03) : 343 - 347
[8] New Lower Bound on the Number of Perfect Matchings in Fullerene Graphs
Heping Zhang
Fuji Zhang
[J]. Journal of Mathematical Chemistry, 2001, 30 : 343 - 347
[9] SOME RESULTS ON CIRCULAR PERFECT GRAPHS AND PERFECT GRAPHS
XU Baogang (School of Mathematics and Computer Science
[J]. Journal of Systems Science & Complexity, 2005, (02) : 167 - 173
[10] MATCHING-PERFECT AND COVER-PERFECT GRAPHS
LEWIN, M
[J]. ISRAEL JOURNAL OF MATHEMATICS, 1974, 18 (04) : 345 - 347

← 1 2 3 4 5 →