Search
Search results for: K%C5%81ADKA%20DLA%20PIESZYCH
Found little results, maybe try searching with alternative method.
Filters
total: 2
filtered: 1
Chosen catalog filters
Search results for: K%C5%81ADKA%20DLA%20PIESZYCH
-
Total domination in versus paired-domination in regular graphs
PublicationA subset S of vertices of a graph G is a dominating set of G if every vertex not in S has a neighbor in S, while S is a total dominating set of G if every vertex has a neighbor in S. If S is a dominating set with the additional property that the subgraph induced by S contains a perfect matching, then S is a paired-dominating set. The domination number, denoted γ(G), is the minimum cardinality of a dominating set of G, while the...