MAXIMAL MATCHINGS IN POLYSPIRO AND BENZENOID CHAINS (CROSBI ID 303421)
Prilog u časopisu | izvorni znanstveni rad | međunarodna recenzija
Podaci o odgovornosti
Došlić, Tomislav ; Short, Taylor
engleski
MAXIMAL MATCHINGS IN POLYSPIRO AND BENZENOID CHAINS
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.
Maximal matching, Benzenoid chain, Polyspiro chain.
nije evidentirano
nije evidentirano
nije evidentirano
nije evidentirano
nije evidentirano
nije evidentirano
Podaci o izdanju
15
2021.
179-200
objavljeno
1452-8630
10.2298/AADM161106003D