crta
Hrvatska znanstvena Sekcija img
bibliografija
3 gif
 Naslovna
 O projektu
 FAQ
 Kontakt
4 gif
Pregledavanje radova
Jednostavno pretraživanje
Napredno pretraživanje
Skupni podaci
Upis novih radova
Upute
Ispravci prijavljenih radova
Ostale bibliografije
Slični projekti
 Bibliografske baze podataka

Pregled bibliografske jedinice broj: 536416

Časopis

Autori: Došlić, Tomislav; Maloy, Frode
Naslov: Chain hexagonal cacti: Matchings and independent sets
( Chain hexagonal cacti: Matchings and independent sets )
Izvornik: Discrete mathematics (0012-365X) 310 (2010); 1176-1190
Vrsta rada: članak
Ključne riječi: Cactus graph; Matching polynomial; Independence polynomial; Hexagonal cactus
( Cactus graph; Matching polynomial; Independence polynomial; Hexagonal cactus )
Sažetak:
In this paper we consider three classes of chain hexagonal cacti and study theirmatching and independence related properties. Explicit recurrences are derived for their matching and independence polynomials, and explicit formulae are presented for the number of matchings and independents sets of certain types. Bivariate generating functions for the number of matchings and independent sets of certain types are also computed and then used to deduce the expected size of matchings and independent sets in chains of given length. It is shown that the extremal chain hexagonal cacti with respect to the number of matchings and of independent sets belong to one of the considered types. Possible directions of further research are discussed.
Projekt / tema: 037-0000000-2779, 177-0000000-0884
Izvorni jezik: eng
Rad je indeksiran u
bazama podataka:
Scopus
SCI-EXP, SSCI i/ili A&HCI
Science Citation Index Expanded (SCI-EXP) (sastavni dio Web of Science Core Collectiona)
Kategorija: Znanstveni
Znanstvena područja:
Matematika
URL cjelovitog teksta:
Google Scholar: Chain hexagonal cacti: Matchings and independent sets
Upisao u CROSBI: doslic@grad.hr (doslic@grad.hr), 10. Stu. 2011. u 13:22 sati



Verzija za printanje   za tiskati


upomoc
foot_4