Pregled bibliografske jedinice broj: 792594
Matchings in $m$-generalized fullerene graphs
Matchings in $m$-generalized fullerene graphs // ARS Mathematica Contemporanea, 11 (2016), 2; 301-313 (međunarodna recenzija, članak, znanstveni)
CROSBI ID: 792594 Za ispravke kontaktirajte CROSBI podršku putem web obrasca
Naslov
Matchings in $m$-generalized fullerene graphs
Autori
Behmaram, Afshin ; Došlić, Tomislav ; Friedland, Shmuel
Izvornik
ARS Mathematica Contemporanea (1855-3966) 11
(2016), 2;
301-313
Vrsta, podvrsta i kategorija rada
Radovi u časopisima, članak, znanstveni
Ključne riječi
perfect matching; Pfaffian graph; fullerene graph; Hadamard-Fischer inequality
Sažetak
A connected planar graph is called $m$-generalized fullerene if two of its faces are $m$-gons and all other faces are pentagons and hexagons. In this paper we first determine some structural properties of $m$-generalized fullerenes and then use them to obtain new results on the enumerative aspects of perfect matchings in such graphs. We provide both upper and lower bounds on the number of perfect matchings in $m$-generalized fullerene graphs and state exact results in some special cases.
Izvorni jezik
Engleski
Znanstvena područja
Matematika
POVEZANOST RADA
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