prikaz prve stranice dokumenta Maximal matchings in polyspiro and benzenoid chains
  Preuzmi
PDF 232.99 KB
Znanstveni rad - Izvorni znanstveni rad
Maximal matchings in polyspiro and benzenoid chains
Applicable Analysis and Discrete Mathematics, 15 (2021); 179-200. https://doi.org/10.2298/AADM161106003D
Došlić, Tomislav; Short, Taylor

Citirajte ovaj rad

Došlić, T. i Short, T. (2021). Maximal matchings in polyspiro and benzenoid chains. Applicable Analysis and Discrete Mathematics, 15., 179-200. doi: 10.2298/AADM161106003D

Došlić, Tomislav i Taylor Short. "Maximal matchings in polyspiro and benzenoid chains." Applicable Analysis and Discrete Mathematics, vol. 15, 2021, str. 179-200. https://doi.org/10.2298/AADM161106003D

Došlić, Tomislav i Taylor Short. "Maximal matchings in polyspiro and benzenoid chains." Applicable Analysis and Discrete Mathematics 15 (2021): 179-200. https://doi.org/10.2298/AADM161106003D

Došlić, T. i Short, T. (2021) 'Maximal matchings in polyspiro and benzenoid chains', Applicable Analysis and Discrete Mathematics, 15, str. 179-200. doi: 10.2298/AADM161106003D

Došlić T, Short T. Maximal matchings in polyspiro and benzenoid chains. Applicable Analysis and Discrete Mathematics [Internet]. 2021. [pristupljeno 12.11.2024.];15:179-200. doi: 10.2298/AADM161106003D

T. Došlić i T. Short, "Maximal matchings in polyspiro and benzenoid chains", Applicable Analysis and Discrete Mathematics, vol. 15, str. 179-200, 2021. [Online]. Dostupno na: https://urn.nsk.hr/urn:nbn:hr:237:253962. [Citirano: 12.11.2024.]

Za citiranje koristite ovu mrežnu adresu: https://urn.nsk.hr/urn:nbn:hr:237:253962
Prijavite se u repozitorij kako biste mogli spremiti objekt u svoju listu.
Podaci o radu
Naslov (engleski)Maximal matchings in polyspiro and benzenoid chains
AutorTomislav Došlić
AutorTaylor Short
Autorova ustanovaSveučilište u Zagrebu
Građevinski fakultet
Znanstveno / umjetničko
područje, polje i grana		TEHNIČKE ZNANOSTI
Građevinarstvo
Sažetak (engleski)
A matching M of a graph G is maximal if it is not a proper subset of any other matching in G. Maximal matchings are much less known and researched than their maximum and perfect counterparts. In this paper we present the recurrences and generating functions for the sequences enumerating maximal matchings in two classes of chemically interesting linear polymers: polyspiro chains and benzenoid chains. We also analyze the asymptotic behavior of those sequences and determine the extremal cases.
Ključne riječi (engleski)
Jezikengleski
Vrsta publikacijeZnanstveni rad - Izvorni znanstveni rad
Status objaveObjavljen
Vrsta recenzijeRecenziran - međunarodna recenzija
Verzija publikacijeObjavljena verzija rada (izdavačev PDF)
Naslov časopisaApplicable Analysis and Discrete Mathematics
Brojčani podacivol. 15, str. 179-200
p-ISSN1452-8630
DOIhttps://doi.org/10.2298/AADM161106003D
URN:NBNurn:nbn:hr:237:253962
Datum objave publikacije2021
Vrsta resursaTekst
Prava pristupaOtvoreni pristup
Uvjeti korištenjaIkona licence Zaštićeno autorskim pravom.
Datum i vrijeme pohrane2024-09-04 13:54:01