Maximum number of minimum dominating and minimum total dominating sets
type: Item
instance of: scholarly article
zbMATH Open document ID: 1301.05248
author: Anant P. Godbole
author: Jessie D. Jamieson
author: William Jamieson
publication date: 2014-08-28T00:00:00Z
full work available at URL: https://arxiv.org/abs/1308.3178
Mathematics Subject Classification ID: 05C69
Mathematics Subject Classification ID: 05C35
zbMATH DE Number: 6335657
zbMATH Keywords: domination number
zbMATH Keywords: total domination number
zbMATH Keywords: extremal graphs
MaRDI profile type: MaRDI publication profile
Recommended article: On maximum number of minimal dominating sets in graphs
Recommended article: Bounds on the maximum number of minimum dominating sets
Recommended article: The maximum number of minimal dominating sets in a tree
Recommended article: Majorization and the minimum number of dominating sets
Recommended article: Minimal dominating sets in maximum domatic partitions
Recommended article: Counting minimal dominating sets
Recommended article: On the number of minimal dominating sets on some graph classes
Recommended article: The number of minimum dominating sets in \(P_n\times P_2\)
Recommended article: Q6054234
Recommended article: Minimal dominating sets in graph classes: combinatorial bounds and enumeration
title: Maximum number of minimum dominating and minimum total dominating sets
published in: Utilitas Mathematica
review text: Given a connected graph of order \(n\) and domination or total domination number \(\gamma\), the paper considers the problem of determining the maximum number of minimum (total) dominating sets. The problem is solved for \(\gamma = 2\) for the domination number and for the total domination number. For larger \(\gamma\), a construction is given that yields a non-trivial lower bound for the domination number.
reviewed by: Sandi Klavžar
description: scientific article; zbMATH DE number 6335657