Combinatorial bounds on connectivity for dominating sets in maximal outerplanar graphs
نویسندگان
چکیده
منابع مشابه
Combinatorial bounds on connectivity for dominating sets in maximal outerplanar graphs
In this article we study some variants of the domination concept attending to the connectivity of the subgraph generated by the dominant set. This study is restricted to maximal outerplanar graphs. We establish tight combinatorial bounds for connected domination, semitotal domination, independent domination and weakly connected domination for any n-vertex maximal outerplaner graph.
متن کاملOn dominating sets of maximal outerplanar graphs
A dominating set of a graph is a set S of vertices such that every vertex in the graph is either in S or is adjacent to a vertex in S. The domination number of a graph G, denoted γ (G), is theminimum cardinality of a dominating set ofG. We show that ifG is an n-vertexmaximal outerplanar graph, then γ (G) ≤ (n + t)/4, where t is the number of vertices of degree 2 in G. We show that this bound is...
متن کاملMonitoring maximal outerplanar graphs
In this paper we define a new concept of monitoring the elements of triangulation graphs by faces. Furthermore, we analyze this, and other monitoring concepts (by vertices and by edges), from a combinatorial point of view, on maximal outerplanar graphs.
متن کاملLower Bounds and Algorithms for Dominating Sets in Web Graphs
In this paper we study the size of generalised dominating sets in two graph processes that are widely used to model aspects of the World Wide Web. On the one hand, we show that graphs generated this way have fairly large dominating sets (i.e., linear in the size of the graph). On the other hand, we present efficient strategies to construct small dominating sets. The algorithmic results represen...
متن کاملMinimal Dominating Sets in Graph Classes: Combinatorial Bounds and Enumeration
The maximum number of minimal dominating sets that a graph on n vertices can have is known to be at most 1.7159. This upper bound might not be tight, since no examples of graphs with 1.5705 or more minimal dominating sets are known. For several classes of graphs, we substantially improve the upper bound on the maximum number of minimal dominating sets in graphs on n vertices. In some cases, we ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Notes in Discrete Mathematics
سال: 2016
ISSN: 1571-0653
DOI: 10.1016/j.endm.2016.09.020