Shortest perfect pseudomatchings in fullerene graphs

Tomislav Došlić, Meysam Taheri-Dehkordi and Gholam Hossein Fath-Tabar

Applied Mathematics and Computation, 2022, vol. 424, issue C

Abstract: A perfect pseudomatching M in a graph G is a spanning subgraph of G whose components are isomorphic to the star K1,3 or to K2. Perfect pseudomatchings interpolate between perfect matchings, in which all components are K2, and perfect star packings, in which all components are stars K1,3. In this contribution we present some results on perfect pseudomatchings with small number of components in some classes of fullerene graphs.

Keywords: Fullerene graph; Perfect matching; Perfect pseudomatching; Perfect star packing (search for similar items in EconPapers)
Date: 2022
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0096300322001126
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:apmaco:v:424:y:2022:i:c:s0096300322001126

DOI: 10.1016/j.amc.2022.127026

Access Statistics for this article

Applied Mathematics and Computation is currently edited by Theodore Simos

More articles in Applied Mathematics and Computation from Elsevier
Bibliographic data for series maintained by Catherine Liu ().