Maximum Number of Minimum Dominating and Minimum Total Dominating Sets

Anant P Godbole,Jessie Jamieson,William B Jamieson

UTILITAS MATHEMATICA（2014）

Cited 23|Views3

No score

Abstract

Given a connected graph with domination (or total domination) number gamma >= 2, we ask for the maximum number m(gamma) and m(T,gamma) of dominating and total dominating sets of size gamma. An exact answer is provided for gamma = 2 and lower bounds are given for m(gamma), m(T,gamma); gamma >= 3.

Translated text

AI Read Science

Must-Reading Tree

Example

Generate MRT to find the research sequence of this paper

Chat Paper

Summary is being generated by the instructions you defined