Abstract
Given a connected graph with domination (or total domination) number γ>=2, we ask for the maximum number m_γand m_{γ,T} of dominating and total dominating sets of size γ. An exact answer is provided for γ=2and lower bounds are given for γ>=3.
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.