Saturation number of nanotubes

DOI10.26493/1855-3974.1056.AE9zbMath1377.92108OpenAlexW2591283116WikidataQ129367098 ScholiaQ129367098MaRDI QIDQ5357309

Niko Tratnik, Petra Žigert Pleteršek

Publication date: 14 September 2017

Published in: Ars Mathematica Contemporanea (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.26493/1855-3974.1056.ae9

zbMATH Keywords

maximal matchingsaturation numberedge domination numberefficient edge dominating setarmchair nanotube\(TUC_4C_8(S)\) nanotubetubulene\(TUC_4C_8(R)\) nanotubeclosed benzenoid chainzig-zag nanotube

Mathematics Subject Classification ID

Molecular structure (graph-theoretic methods, methods of differential topology, etc.) (92E10) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (5)

Global forcing number for maximal matchings in corona products ⋮ Smallest maximal matchings of graphs ⋮ Counting the maximal and perfect matchings in benzenoid chains ⋮ Saturation number of lattice animals ⋮ Maximal matchings in polyspiro and benzenoid chains

This page was built for publication: Saturation number of nanotubes