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 条
  • [31] SHORTEST PATHS IN REACHABILITY GRAPHS
    DESEL, J
    ESPARZA, J
    JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 1995, 51 (02) : 314 - 323
  • [32] Shortest Paths in Euclidean Graphs
    Sedgewick, Robert
    Vitter, Jeffrey Scott
    ALGORITHMICA, 1986, 1 (1-4) : 31 - 48
  • [33] SHORTEST COVERINGS OF GRAPHS WITH CYCLES
    BERMOND, JC
    JACKSON, B
    JAEGER, F
    JOURNAL OF COMBINATORIAL THEORY SERIES B, 1983, 35 (03) : 297 - 308
  • [34] Perfect and precisely perfect fuzzy graphs
    Nair, Premchand S.
    2008 ANNUAL MEETING OF THE NORTH AMERICAN FUZZY INFORMATION PROCESSING SOCIETY, VOLS 1 AND 2, 2008, : 245 - 248
  • [35] Cycle-perfect graphs are perfect
    Le, VB
    JOURNAL OF GRAPH THEORY, 1996, 23 (04) : 351 - 353
  • [36] Finding Shortest Contractible and Shortest Separating Cycles in Embedded Graphs
    Cabello, Sergio
    ACM TRANSACTIONS ON ALGORITHMS, 2010, 6 (02)
  • [37] Finding shortest contractible and shortest separating cycles in embedded graphs
    Cabello, Sergio
    PROCEEDINGS OF THE TWENTIETH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2009, : 616 - 624
  • [38] Perfect graphs, partitionable graphs and cutsets
    Conforti, M
    Cornuéjols, G
    Gasparyan, G
    Vuskovic, K
    COMBINATORICA, 2002, 22 (01) : 19 - 33
  • [39] Perfect Graphs, Partitionable Graphs and Cutsets
    Michele Conforti
    Gérard Cornuéjols
    Grigor Gasparyan
    Kristina Vušković
    Combinatorica, 2002, 22 : 19 - 33
  • [40] Progress on perfect graphs
    Maria Chudnovsky
    Neil Robertson
    P. D. Seymour
    Robin Thomas
    Mathematical Programming, 2003, 97 : 405 - 422
12345