Matchings in hexagonal cacti (Q579281): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 00:42, 5 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Matchings in hexagonal cacti |
scientific article |
Statements
Matchings in hexagonal cacti (English)
0 references
1987
0 references
Explicit recurrences are derived for the matching polynomials of the basic types of hexagonal cacti, the linear cactus and the star cactus and also for an associated graph, called the hexagonal crown. Tables of the polynomials are given for each type of graph. Explicit formulae are then obtained for the number of defect-d matchings in the graphs, for various values of d. In particular, formulae are derived for the number of perfect matchings in all three types of graphs. Finally, results are given for the total number of matchings in the graphs.
0 references
matching polynomials
0 references
hexagonal cacti
0 references
linear cactus
0 references
star cactus
0 references
hexagonal crown
0 references
defect-d matchings
0 references
perfect matchings
0 references
