### Cut-vertices and domination in graphs (1995).Cut-vertices and domination in graphs (1995).

Access Restriction
Open

 Author Vestergaard, Preben Dahl ♦ Zelinka, Bohdan Source CiteSeerX Content type Text File Format PDF
 Subject Domain (in DDC) Computer science, information & general works ♦ Data processing & computer science Subject Keyword Total Dominating ♦ Undirected Graph ♦ Isolated Vertex ♦ Minimum Valency Abstract spectively). Note that d(G) is well-defined for every finite, undirected graph, while d t (G) is defined only for graphs without isolated vertices. Consider in G a vertex v of minimum valency #(G). Then a dominating set must contain v or a neighbour of v, thus it is obvious that d(G) 6 #(G) + 1. A total dominating set must contain a neighbour of v, thus d t (G) 6 #(G). We shall consider the case when a graph G is the union of two graphs G 1 , G 2 having exactly one common vertex a; this vertex a is a cut-vertex of G. The gra Educational Role Student ♦ Teacher Age Range above 22 year Educational Use Research Education Level UG and PG ♦ Career/Technical Study Publisher Date 1995-01-01