Naslov
Shortest perfect pseudomatchings in fullerene graphs

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

Izvornik
Applied mathematics and computation (0096-3003) 424 (2022); 127026, 11

Vrsta, podvrsta i kategorija rada
Radovi u časopisima, članak, znanstveni

Ključne riječi
Fullerene graph ; Perfect matching ; Perfect pseudomatching ; Perfect star packing

Sažetak
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.

Izvorni jezik
Engleski

Znanstvena područja
Matematika

POVEZANOST RADA