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 条
12345