Pregled bibliografske jedinice broj: 1169313
Restricted 2-extendability of (3,6)-fullerenes
Restricted 2-extendability of (3,6)-fullerenes // Discrete applied mathematics, 298 (2021), 1-6 doi:10.1016/j.dam.2021.03.010 (međunarodna recenzija, članak, znanstveni)
CROSBI ID: 1169313 Za ispravke kontaktirajte CROSBI podršku putem web obrasca
Naslov
Restricted 2-extendability of (3,6)-fullerenes
Autori
Došlić, Tomislav
Izvornik
Discrete applied mathematics (0166-218X) 298
(2021);
1-6
Vrsta, podvrsta i kategorija rada
Radovi u časopisima, članak, znanstveni
Ključne riječi
Fullerene graph (3, 6)-fullerene Perfect matching 2-extendability Restricted 2- extendability
Sažetak
A graph G with a perfect matching is k-extendable if it has a matching of size k and if every such matching can be extended to a perfect matching in G. It is well known that (3, 6)-fullerene graphs are not 2-extendable. In this contribution we examine what can be salvaged and under what conditions can a matching of size two be extended to a perfect matching in a (3, 6)-fullerene graph.
Izvorni jezik
Engleski
Znanstvena područja
Matematika
POVEZANOST RADA
Projekti:
HRZZ-IP-2016-06-1142 - Svjetlo na molekulama: istraživanje spregnute elektronske i nuklearne dinamike (LightMol) (Došlić, Nađa, HRZZ - 2016-06) ( CroRIS)
Ustanove:
Građevinski fakultet, Zagreb
Profili:
Tomislav Došlić
(autor)
Citiraj ovu publikaciju:
Časopis indeksira:
- Current Contents Connect (CCC)
- Web of Science Core Collection (WoSCC)
- Science Citation Index Expanded (SCI-EXP)
- SCI-EXP, SSCI i/ili A&HCI
- Scopus
