Displaying similar documents to “ The Domination Number of K 3 n ”

Total domination subdivision numbers of graphs

Teresa W. Haynes, Michael A. Henning, Lora S. Hopkins (2004)

Discussiones Mathematicae Graph Theory

Similarity:

A set S of vertices in a graph G = (V,E) is a total dominating set of G if every vertex of V is adjacent to a vertex in S. The total domination number of G is the minimum cardinality of a total dominating set of G. The total domination subdivision number of G is the minimum number of edges that must be subdivided (where each edge in G can be subdivided at most once) in order to increase the total domination number. First we establish bounds on the total domination subdivision number...

Graphs with disjoint dominating and paired-dominating sets

Justin Southey, Michael Henning (2010)

Open Mathematics

Similarity:

A dominating set of a graph is a set of vertices such that every vertex not in the set is adjacent to a vertex in the set, while a paired-dominating set of a graph is a dominating set such that the subgraph induced by the dominating set contains a perfect matching. In this paper, we show that no minimum degree is sufficient to guarantee the existence of a disjoint dominating set and a paired-dominating set. However, we prove that the vertex set of every cubic graph can be partitioned...

The ramsey number for theta graph versus a clique of order three and four

M.S.A. Bataineh, M.M.M. Jaradat, M.S. Bateeha (2014)

Discussiones Mathematicae Graph Theory

Similarity:

For any two graphs F1 and F2, the graph Ramsey number r(F1, F2) is the smallest positive integer N with the property that every graph on at least N vertices contains F1 or its complement contains F2 as a subgraph. In this paper, we consider the Ramsey numbers for theta-complete graphs. We determine r(θn,Km) for m = 2, 3, 4 and n > m. More specifically, we establish that r(θn,Km) = (n − 1)(m − 1) + 1 for m = 3, 4 and n > m

Two Short Proofs on Total Domination

Allan Bickle (2013)

Discussiones Mathematicae Graph Theory

Similarity:

A set of vertices of a graph G is a total dominating set if each vertex of G is adjacent to a vertex in the set. The total domination number of a graph Υt (G) is the minimum size of a total dominating set. We provide a short proof of the result that Υt (G) ≤ 2/3n for connected graphs with n ≥ 3 and a short characterization of the extremal graphs.