Some results of domination on the discrete topological graph with its inverse

Let G_{\tau }=\left(V,\ E\right) be a topological graph which is a finite, simple, undirected, connected graph without isolated vertices. In this paper, several bounds and domination parameters are studied and applied to it: bi-domination, doubly connected bi-domination and pitchfork domination. The dominating set and domination number with its inverse for all these types are calculated. Also, some figures from the topological graph are introduced.

کلیدواژه ها:

Topological graph ، discrete topology ، dominating set ، domination number