The saturation number of carbon nanocones and nanotubes

2018/07/30 by Taylor Short, Short, Taylor · 1 citation
Mathematics · Chemistry · #Graph theory and applications #Synthesis and Properties of Aromatic Compounds #Advanced Combinatorial Mathematics

paper · pdf · doi:10.48550/arxiv.1807.11355

Abstract

The saturation number of a graph is the cardinality of a smallest maximal matching. This paper presents bounds for the saturation number of carbon nanocones which are asymptotically equal. The same techniques are applied for the saturation number of certain families of carbon nanotubes, which improve previous results and in one case, yields the exact value.

Cited by

• On the maximal matchings of trees

Related

• Sandwiching saturation number of fullerene graphs
• On the saturation number of graphs
• The saturation number of C₆
• Characterizing the fullerene graphs with the minimum forcing number 3
• A lower bound on the saturation number, and graphs for which it is sharp