engleski

Complexity of some interesting (chemical) graphs

Complexity of some interesting polycyclic graphs is expressed in terms of the corresponding spanning trees. Graphs considered were a selection of all connected graphs with four and five vertices, graphs composed of two parts, or more parts, connected by a single edge, the Petersen graph, the Blanusa graph, the Desargues-Levy graph and the Schlegel graph of buckminsterfullerene.

square-cell configurations ; spanning-trees ; molecular complexity ; aromatic-compounds ; fullerenes ; cycloarenes ; chemistry ; kekulene ; number

Izlaganje sa skupa