prikaz prve stranice dokumenta Maximal matchings in polyspiro and benzenoid chains
  Download
PDF 232.99 KB
Scientific paper - Original scientific paper
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

Institutional repository: Repository of the Faculty of Civil Engineering, University of Zagreb

Cite this document

Došlić, T. & 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 and Taylor Short. "Maximal matchings in polyspiro and benzenoid chains." Applicable Analysis and Discrete Mathematics, vol. 15, 2021, pp. 179-200. https://doi.org/10.2298/AADM161106003D

Došlić, Tomislav and 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. and Short, T. (2021) 'Maximal matchings in polyspiro and benzenoid chains', Applicable Analysis and Discrete Mathematics, 15, pp. 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 [cited 2024 December 27];15:179-200. doi: 10.2298/AADM161106003D

T. Došlić and T. Short, "Maximal matchings in polyspiro and benzenoid chains", Applicable Analysis and Discrete Mathematics, vol. 15, pp. 179-200, 2021. [Online]. Available at: https://urn.nsk.hr/urn:nbn:hr:237:253962. [Accessed: 27 December 2024]

Metadata
Title (english)Maximal matchings in polyspiro and benzenoid chains
AuthorTomislav Došlić
AuthorTaylor Short
Author's institutionUniversity of Zagreb
Faculty of Civil Engineering
Scientific / art field,
discipline and subdiscipline		TECHNICAL SCIENCES
Civil Engineering
Abstract (english)
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.
Keywords (english)
Languageenglish
Publication typeScientific paper - Original scientific paper
Publication statusPublished
Peer reviewPeer review - international
Publication versionPublished version
Journal titleApplicable Analysis and Discrete Mathematics
Numberingvol. 15, pp. 179-200
p-ISSN1452-8630
DOIhttps://doi.org/10.2298/AADM161106003D
URN:NBNurn:nbn:hr:237:253962
Publication2021
Type of resourceText
Access conditionsOpen access
Terms of useLicence In copyright icon
Created on2024-09-04 13:54:01