The saturation number of carbon nanocones and nanotubes
classification
🧮 math.CO
keywords
numbersaturationcarbonnanoconesnanotubesappliedasymptoticallybounds
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.