| Title: | Enumerating the number of $k$-matchings in successively amalgamated graphs |
|---|
| Authors: | ID Grad, Simon (Author)
ID Klavžar, Sandi (Author) |
|---|
| Files: |  PDF - Presentation file, download (1,59 MB)
MD5: 0FF0AFB7B3EA08E76059389AC6697D9F
 URL - Source URL, visit https://www.sciencedirect.com/science/article/pii/S0096300325004291
|
|---|
| Language: | English |
|---|
| Typology: | 1.01 - Original Scientific Article |
|---|
| Organization: |  IMFM - Institute of Mathematics, Physics, and Mechanics
|
|---|
| Abstract: | In this paper, the transfer matrix technique using the $k$-matching vector is developed to compute the number of $k$-matchings in an arbitrary graph which can be constructed by successive amalgamations over sets of cardinality two. This widely extends known methods from the literature developed for computing the number of $k$-matchings in benzenoid chains, octagonal chains, cyclooctatetraene chains, and arbitrary cyclic chains. Two examples demonstrating how the present method can be applied are given, one of them being an elaborated chemical example. |
|---|
| Keywords: | matchings, transfer matrix, k-matching vector, chemical graphs, Toeplitz matrix |
|---|
| Publication status: | Published |
|---|
| Publication version: | Version of Record |
|---|
| Publication date: | 01.02.2026 |
|---|
| Year of publishing: | 2026 |
|---|
| Number of pages: | 9 str. |
|---|
| Numbering: | Vol. 510, article no. 129703 |
|---|
| PID: | 20.500.12556/DiRROS-23434  |
|---|
| UDC: | 519.17 |
|---|
| ISSN on article: | 0096-3003 |
|---|
| DOI: | 10.1016/j.amc.2025.129703 |
|---|
| COBISS.SI-ID: | 247009539 |
|---|
| Note: |
|
|---|
| Publication date in DiRROS: | 29.08.2025 |
|---|
| Views: | 330 |
|---|
| Downloads: | 152 |
|---|
| Metadata: |    |
|---|
|
:
|
Copy citation |
|---|
| | | | Share: |  |
|---|
Hover the mouse pointer over a document title to show the abstract or click
on the title to get all document metadata. |
