Journal
APPLIED MATHEMATICS AND COMPUTATION
Volume 424, Issue -, Pages -Publisher
ELSEVIER SCIENCE INC
DOI: 10.1016/j.amc.2022.127026
Keywords
Fullerene graph; Perfect matching; Perfect pseudomatching; Perfect star packing
Categories
Funding
- Croatian Science Foundation via research project LightMol [HRZZ-IP-2016-06-1142]
- Slovenian ARRS [J1-3002]
- University of Kashan [985985/2]
Ask authors/readers for more resources
This article presents some results on perfect pseudomatchings with a small number of components in some classes of fullerene graphs.
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.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available
Share Paper
