| Naslov: | Enumerating the number of $k$-matchings in successively amalgamated graphs |
|---|
| Avtorji: | ID Grad, Simon (Avtor)
ID Klavžar, Sandi (Avtor) |
|---|
| Datoteke: |  PDF - Predstavitvena datoteka, prenos (1,59 MB)
MD5: 0FF0AFB7B3EA08E76059389AC6697D9F
 URL - Izvorni URL, za dostop obiščite https://www.sciencedirect.com/science/article/pii/S0096300325004291
|
|---|
| Jezik: | Angleški jezik |
|---|
| Tipologija: | 1.01 - Izvirni znanstveni članek |
|---|
| Organizacija: |  IMFM - Inštitut za matematiko, fiziko in mehaniko
|
|---|
| Povzetek: | 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. |
|---|
| Ključne besede: | matchings, transfer matrix, k-matching vector, chemical graphs, Toeplitz matrix |
|---|
| Status publikacije: | Objavljeno |
|---|
| Verzija publikacije: | Objavljena publikacija |
|---|
| Datum objave: | 01.02.2026 |
|---|
| Leto izida: | 2026 |
|---|
| Št. strani: | 9 str. |
|---|
| Številčenje: | Vol. 510, article no. 129703 |
|---|
| PID: | 20.500.12556/DiRROS-23434  |
|---|
| UDK: | 519.17 |
|---|
| ISSN pri članku: | 0096-3003 |
|---|
| DOI: | 10.1016/j.amc.2025.129703 |
|---|
| COBISS.SI-ID: | 247009539 |
|---|
| Opomba: |
|
|---|
| Datum objave v DiRROS: | 29.08.2025 |
|---|
| Število ogledov: | 328 |
|---|
| Število prenosov: | 150 |
|---|
| Metapodatki: |    |
|---|
|
:
|
Kopiraj citat |
|---|
| | | | Objavi na: |  |
|---|
Postavite miškin kazalec na naslov za izpis povzetka. Klik na naslov izpiše
podrobnosti ali sproži prenos. |
