Received 20 March 2019 Accepted 04 June 2019
A matching M in a graph G is maximal if it cannot be extended to a larger matching in G. The enumerative properties of maximal matchings are much less known and researched than for maximum and perfect matchings. In this paper we present the recurrences and generating functions for the sequences enumerating maximal matchings in rooted products of paths and short cycles. We also analyze the asymptotic behavior of those sequences.
*lejla.pasic@ssst.edu.ba Citation:
Nema pronađenih rezultata, molimo da izmjenite uslove pretrage i pokušate ponovo!
Ova stranica koristi kolačiće da bi vam pružila najbolje iskustvo
Saznaj više