Shortest perfect pseudomatchings in fullerene graphs

被引：3
|
作者：
Doslic, Tomislav [1 ,2 ]
Taheri-Dehkordi, Meysam [3 ]
Fath-Tabar, Gholam Hossein [3 ]
机构：
[1] Univ Zagreb, Fac Civil Engn, Kaciceva 26, Zagreb 10000, Croatia
[2] Fac Informat Studies, Novo Mesto, Slovenia
[3] Univ Kashan, Fac Math Sci, Dept Pure Math, Kashan 8731753153, Iran
来源：
APPLIED MATHEMATICS AND COMPUTATION | 2022年 / 424卷
关键词：
Fullerene graph; Perfect matching; Perfect pseudomatching; Perfect star packing; CYCLICAL EDGE-CONNECTIVITY;
D O I：
10.1016/j.amc.2022.127026
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
A perfect pseudomatching M in a graph G is a spanning subgraph of G whose components are isomorphic to the star K-1(,3) or to K-2. Perfect pseudomatchings interpolate between perfect matchings, in which all components are K-2, and perfect star packings, in which all components are stars K-1(,3). In this contribution we present some results on perfect pseudomatchings with small number of components in some classes of fullerene graphs. (C) 2022 Elsevier Inc. All rights reserved.
引用
收藏
页数：11
相关论文
共 50 条
  • [1] Shortest perfect pseudomatchings in fullerene graphs
    Došlić, Tomislav
    Taheri-Dehkordi, Meysam
    Fath-Tabar, Gholam Hossein
    Applied Mathematics and Computation, 2022, 424
  • [2] The fullerene graphs with a perfect star packing
    Shi, Lingjuan
    ARS MATHEMATICA CONTEMPORANEA, 2023, 23 (01)
  • [3] Fullerene Graphs with Exponentially Many Perfect Matchings
    Tomislav Došlić
    Journal of Mathematical Chemistry, 2007, 41 : 183 - 192
  • [4] Fullerene graphs with exponentially many perfect matchings
    Doslic, Tomislav
    JOURNAL OF MATHEMATICAL CHEMISTRY, 2007, 41 (02) : 183 - 192
  • [5] On lower bounds of number of perfect matchings in fullerene graphs
    Tomislav Došlić
    Journal of Mathematical Chemistry, 1998, 24 : 359 - 364
  • [6] Fullerene graphs have exponentially many perfect matchings
    Kardos, Frantisek
    Kral, Daniel
    Miskuf, Jozef
    Sereni, Jean-Sebastien
    JOURNAL OF MATHEMATICAL CHEMISTRY, 2009, 46 (02) : 443 - 447
  • [7] On lower bounds of number of perfect matchings in fullerene graphs
    Doslic, T
    JOURNAL OF MATHEMATICAL CHEMISTRY, 1998, 24 (04) : 359 - 364
  • [8] Fullerene graphs have exponentially many perfect matchings
    František Kardoš
    Daniel Král’
    Jozef Miškuf
    Jean-Sébastien Sereni
    Journal of Mathematical Chemistry, 2009, 46 : 443 - 447
  • [9] On the Number of Perfect Star Packing and Perfect Pseudo-Matching in Some Fullerene Graphs
    Taheri-Dehkordi, Meysam
    Fath-Tabar, Gholam Hossein
    IRANIAN JOURNAL OF MATHEMATICAL CHEMISTRY, 2023, 14 (01): : 7 - 18
  • [10] New lower bound on the number of perfect matchings in fullerene graphs
    Zhang, HP
    Zhang, FJ
    JOURNAL OF MATHEMATICAL CHEMISTRY, 2001, 30 (03) : 343 - 347
12345