<?xml version="1.0"?>
<metadata xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:dc="http://purl.org/dc/elements/1.1/"><dc:title>Enumerating $k$-matchings in cyclic chains using the transfer matrix technique</dc:title><dc:creator>Klavžar,	Sandi	(Avtor)
	</dc:creator><dc:creator>Grad,	Simon	(Avtor)
	</dc:creator><dc:subject>matchings</dc:subject><dc:subject>Hosoya index</dc:subject><dc:subject>cyclic chains</dc:subject><dc:subject>transfer matrix</dc:subject><dc:subject>k-matching vector</dc:subject><dc:subject>Toeplitz matrix</dc:subject><dc:description>A cyclic chain is a plane graph whose all inner faces are cycles and its inner dual is isomorphic to a path. In this paper, the transfer matrix technique using the $k$-matching vector is developed to compute the number of $k$-matchings in an arbitrary cyclic chain. This extends similar methods developed earlier in two papers for benzenoid chains and for octagonal chains. The method is illustrated on the flourene molecule.</dc:description><dc:date>2025</dc:date><dc:date>2025-05-06 14:08:59</dc:date><dc:type>Članek v reviji</dc:type><dc:identifier>168988</dc:identifier><dc:identifier>UDK: 519.17</dc:identifier><dc:identifier>ISSN pri članku: 3009-4399</dc:identifier><dc:identifier>DOI: 10.46793/match.94-3.26824</dc:identifier><dc:identifier>COBISS_ID: 234927875</dc:identifier><dc:language>sl</dc:language></metadata>
