Chain hexagonal cacti: matchings and independent sets

DOI10.1016/j.disc.2009.11.026zbMath1222.05197OpenAlexW2060832656MaRDI QIDQ973140

Tomislav Došlić, Frode Måløy

Publication date: 28 May 2010

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2009.11.026

zbMATH Keywords

matching polynomialcactus graphindependence polynomialhexagonal cactus

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (18)

A heuristic for the coloring of planar graphs ⋮ Planar polycyclic graphs and their Tutte polynomials ⋮ The expected values of Hosoya index and Merrifield-Simmons index in a random polyphenylene chain ⋮ Wiener indices of spiro and polyphenyl hexagonal chains ⋮ The expected values for the Schultz index, Gutman index, multiplicative degree-Kirchhoff index and additive degree-Kirchhoff index of a random polyphenylene chain ⋮ Enumeration of maximum matchings in the Hanoi graphs using matching polynomials ⋮ Counting maximal independent sets in some \(n\)-gonal cacti ⋮ Counting independent dominating sets in linear polymers ⋮ Matching polynomials for chains of cycles ⋮ The expected subtree number index in random polyphenylene and spiro chains ⋮ Wiener polarity index of fullerenes and hexagonal systems ⋮ Wiener polarity index of cycle-block graphs ⋮ Subtrees of spiro and polyphenyl hexagonal chains ⋮ Enumeration of subtrees and BC-subtrees with maximum degree no more than \(k\) in trees ⋮ On Spiro and polyphenyl hexagonal chains with respect to the number of BC-subtrees ⋮ Block allocation of a sequential resource ⋮ Matching polynomials for some nanostar dendrimers ⋮ Maximal matchings in polyspiro and benzenoid chains

Cites Work

• Matchings in hexagonal cacti
• Matching theory
• An introduction to matching polynomials
• The obnoxious center problem on weighted cactus graphs.
• Vertex and tree arboricities of graphs
• The dissimilarity characteristic of Husimi trees
• COMBINATORIAL PROBLEMS IN THE THEORY OF GRAPHS. III
• The ratio of the irredundance number and the domination number for block-cactus graphs
• Polymers with attractive interactions on the Husimi lattice
• On the Number of Husimi Trees
• Algorithms and Computation
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Chain hexagonal cacti: matchings and independent sets