Maximal matchings in polyspiro and benzenoid chains

DOI10.2298/AADM161106003DzbMath1499.05513arXiv1511.00590MaRDI QIDQ5028845

Taylor Short, Tomislav Došlić

Publication date: 10 February 2022

Published in: Applicable Analysis and Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1511.00590

zbMATH Keywords

maximal matchingbenzenoid chainpolyspiro chain

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Molecular structure (graph-theoretic methods, methods of differential topology, etc.) (92E10) Chemical graph theory (05C92)

Related Items (3)

Extremal graphs for average sizes of maximal matchings ⋮ Hosoya index of thorny polymers ⋮ Counting the maximal and perfect matchings in benzenoid chains

Uses Software

• OEIS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Twelve countings with rooted plane trees
• On the number of matchings of a tree
• Trees with maximum number of maximal matchings
• Saturation number of fullerene graphs
• Chain hexagonal cacti: matchings and independent sets
• Matching theory
• An introduction to matching polynomials
• Small maximal matchings in random graphs.
• Perfect edge domination and efficient edge domination in graphs
• Independent domination in graphs: A survey and recent results
• The statistics of dimers on a lattice
• Counting maximal matchings in linear polymers
• Augmented Eccentric Connectivity Index of Grid Graphs
• Sandwiching saturation number of fullerene graphs
• Saturation number of nanotubes

This page was built for publication: Maximal matchings in polyspiro and benzenoid chains