Minimal graphs with disjoint dominating and total dominating sets
Copyright policy )Minimal graphs with disjoint dominating and total dominating sets
A graph $G$ is a DTDP-graph if it has a pair $(D,T)$ of disjoint sets of vertices of $G$ such that $D$ is a dominating set and $T$ is a total dominating set of $G$. Such graphs were studied in a number of research papers. In this paper we study further properties of DTDP-graphs and, in particular, we characterize minimal DTDP-gaphs without loops.
23 pages, 12 figures
Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.), Graph algorithms (graph-theoretic aspects), QA1-939, FOS: Mathematics, total domination, Mathematics - Combinatorics, Combinatorics (math.CO), Mathematics, domination, 05C69, 05C85
Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.), Graph algorithms (graph-theoretic aspects), QA1-939, FOS: Mathematics, total domination, Mathematics - Combinatorics, Combinatorics (math.CO), Mathematics, domination, 05C69, 05C85
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
Citations provided by BIP!Popularity provided by BIP!