Please use this identifier to cite or link to this item:
http://hdl.handle.net/20.500.12188/17765| Title: | Sandwiching saturation number of fullerene graphs | Authors: | Vesna Andova František Kardoš Riste Škrekovski |
Keywords: | Mathematics - Combinatorics Mathematics - Combinatorics |
Issue Date: | 9-May-2014 | Journal: | MATCH Commun. Math. Comput. Chem | Series/Report no.: | MATCH Commun. Math. Comput. Chem;73 | Abstract: | The saturation number of a graph $G$ is the cardinality of any smallest maximal matching of $G$, and it is denoted by $s(G)$. Fullerene graphs are cubic planar graphs with exactly twelve 5-faces; all the other faces are hexagons. They are used to capture the structure of carbon molecules. Here we show that the saturation number of fullerenes on $n$ vertices is essentially $n/3$. | URI: | http://hdl.handle.net/20.500.12188/17765 |
| Appears in Collections: | Faculty of Electrical Engineering and Information Technologies: Journal Articles |
Show full item record
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.