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 条
  • [31] Perfect arborescence packing in preflow mincut graphs
    Gabow, HN
    [J]. PROCEEDINGS OF THE SEVENTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 1996, : 528 - 538
  • [32] SOME VARIATIONS OF PERFECT GRAPHS
    Dettlaff, Magda
    Lemanska, Magdalena
    Semanisin, Gabriel
    Zuazua, Rita
    [J]. DISCUSSIONES MATHEMATICAE GRAPH THEORY, 2016, 36 (03) : 661 - 668
  • [33] SOME DISTRIBUTIONS THAT ALLOW PERFECT PACKING
    RHEE, WT
    TALAGRAND, M
    [J]. JOURNAL OF THE ACM, 1988, 35 (03) : 564 - 578
  • [34] On the number of perfect matchings of line graphs
    Dong, Fengming
    Yan, Weigen
    Zhang, Fuji
    [J]. DISCRETE APPLIED MATHEMATICS, 2013, 161 (06) : 794 - 801
  • [35] Cospectral regular graphs with and without a perfect matching
    Blazsik, Zoltan L.
    Cummings, Jay
    Haemers, Willem H.
    [J]. DISCRETE MATHEMATICS, 2015, 338 (03) : 199 - 201
  • [36] A PERFECT MATCHING ALGORITHM FOR SPARSE BIPARTITE GRAPHS
    TOCZYLOWSKI, E
    [J]. DISCRETE APPLIED MATHEMATICS, 1984, 9 (03) : 263 - 268
  • [37] A linear algorithm for a perfect matching in polyomino graphs
    Lin, Yuqing
    Zhang, Fuji
    [J]. THEORETICAL COMPUTER SCIENCE, 2017, 675 : 82 - 88
  • [38] Perfect Matching in Random Graphs is as Hard as Tseitin
    Austrin, Per
    Risse, Kilian
    [J]. PROCEEDINGS OF THE 2022 ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, SODA, 2022, : 979 - 1012
  • [39] On Minimal Energies of Unicyclic Graphs with Perfect Matching
    Zhu, Jianming
    [J]. MATCH-COMMUNICATIONS IN MATHEMATICAL AND IN COMPUTER CHEMISTRY, 2013, 70 (01) : 97 - 118
  • [40] The Wiener index of unicyclic graphs with perfect matching
    Chen, Ya-Hong
    [J]. Shanghai Jiaotong Daxue Xuebao/Journal of Shanghai Jiaotong University, 2010, 44 (06): : 844 - 848
12345