Counting the number of weakly connected dominating sets of graphs

2014/12/28 by Alikhani, Saeid, Jahari, Somayeh, Mehryar, Mohammad
#05C05 #05C69 #Combinatorics (math.CO) #FOS: Mathematics

paper · doi:10.48550/arxiv.1412.8138

Abstract

Let G=(V(G),E(G)) be a simple graph. A non-empty set S⊆ V (G) is a weakly connected dominating set in G, if the subgraph obtained from G by removing all edges each joining any two vertices in V (G)∖ S is connected. In this paper, we consider some graphs and study the number of their weakly connected dominating sets.

Related

• On the number of isolate dominating sets of certain graphs
• Below all subsets for Minimal Connected Dominating Set
• A Note on the Maximum Number of Minimal Connected Dominating Sets in a Graph
• On the number of fair dominating sets of graphs
• Three domination number and connectivity in graphs