engleski

Domination numbers of simple polygonal chains and multiple linear hexagonal chains

This thesis is focused on distance k-domination and total domination on two types of graphs: simple polygonal chains (with cactus chains included) and multiple linear hexagonal chains. For some special types of considered graphs minimum domination sets are determined and their cardinal numbers are caclulated. For more general types of these graph, the bounds for domination numbers are given.

m-cactus chains ; polygonal chains ; multiple linear hexagonal chains ; distance k-domination ; total domination

nije evidentirano