
handle: 11454/79052
Summary: A set \(D \subseteq V(G)\) is an independent transversal dominating set of \(G\) if \(D\) is a dominating set and also intersects every maximum independent set in \(G\). The minimum cardinality of such a set is equal to the transversal domination number, denoted by \(\gamma_\mathrm{it}(G)\). This paper is devoted to the computation of the independent transversal domination number of some complementary prism.
Graph theory, Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.), Distance in graphs, independent transversal domination, complementary prism, domination
Graph theory, Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.), Distance in graphs, independent transversal domination, complementary prism, domination
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 0 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
