Matchings in hexagonal cacti
From MaRDI portal
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.
Recommendations
- Chain hexagonal cacti: matchings and independent sets
- Perfect matchings in hexagonal systems
- Perfect matchings in hexagonal systems
- scientific article; zbMATH DE number 3968626
- A theorem concerning perfect matchings in hexagonal systems
- scientific article; zbMATH DE number 867659
- scientific article; zbMATH DE number 3920526
- Minimum degree distance among cacti with perfect matchings
- scientific article; zbMATH DE number 4041964
- scientific article; zbMATH DE number 4047772
Cited in
(7)- The number of matchings of low order in hexagonal systems
- The \(\rho\)-moments of vertex-weighted graphs
- scientific article; zbMATH DE number 4014767 (Why is no real title available?)
- scientific article; zbMATH DE number 3861207 (Why is no real title available?)
- Matching polynomials for chains of cycles
- Domination numbers on an octagonal chain and an octagonal grid
- Chain hexagonal cacti: matchings and independent sets
This page was built for publication: Matchings in hexagonal cacti
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q579281)
