233 research outputs found
DETERMINATION OF THE RESTRAINED DOMINATION NUMBER ON VERTEX AMALGAMATION AND EDGE AMALGAMATION OF THE PATH GRAPH WITH THE SAME ORDER
Graph theory is a mathematics section that studies discrete objects. One of the concepts studied in graph theory is the restrained dominating set which aims to find the restrained dominating number. This research was conducted by examining the graph operation result of the vertex and edges amalgamation of the path graph in the same order. The method used in this research is the deductive method by using existing theorems to produce new theorems that will be proven deductively true. This research aimed to determine the restrained dominating number in vertex and edges amalgamation of the path graph in the same order. The results obtained from this study are in the form of the theorem about the restrained dominating number of vertex and edges amalgamation of the path graph in the same order, namely: for , ⌋, and for , ⌋
-set problem in graphs
A subset of a graph is a -set if every
vertex is adjacent to at least but not more than
vertices in D. The cardinality of a minimum -set of , denoted as
, is called the -domination number of . Given a
graph and an integer , the decision version of the -set
problem is to decide whether has a -set of cardinality at most .
In this paper, we first obtain an upper bound on using
probabilistic methods, for bounded minimum and maximum degree graphs. Our bound
is constructive, by the randomized algorithm of Moser and Tardos [MT10], We
also show that the - set problem is NP-complete for chordal graphs.
Finally, we design two algorithms for finding of a tree
and a split graph, for any fixed , which answers an open question posed in
[CHHM13]
Bipartitions Based on Degree Constraints
For a graph G = (V,E), we consider a bipartition {V1,V2} of the vertex set V by placing constraints on the vertices as follows. For every vertex v in Vi, we place a constraint on the number of neighbors v has in Vi and a constraint on the number of neighbors it has in V3-i. Using three values, namely 0 (no neighbors are allowed), 1 (at least one neighbor is required), and X (any number of neighbors are allowed) for each of the four constraints, results in 27 distinct types of bipartitions. The goal is to characterize graphs having each of these 27 types. We give characterizations for 21 out of the 27. Three other characterizations appear in the literature. The remaining three prove to be quite difficult. For these, we develop properties and give characterization of special families
Forbidden subgraphs for constant domination number
In this paper, we characterize the sets of connected graphs
such that there exists a constant satisfying for every connected -free graph , where is the
domination number of .Comment: 6 pages, 1 figur
Complexity and approximation ratio of semitotal domination in graphs
A set is a semitotal dominating set of a graph if
it is a dominating set of and
every vertex in is within distance 2 of another vertex of . The
semitotal domination number is the minimum
cardinality of a semitotal dominating set of .
We show that the semitotal domination problem is
APX-complete for bounded-degree graphs, and the semitotal domination problem in any graph of maximum degree can be approximated with an approximation
ratio of
Stratification and domination in graphs.
Thesis (Ph.D.)-University of KwaZulu-Natal, Pietermaritzburg, 2006.In a recent manuscript (Stratification and domination in graphs. Discrete Math. 272 (2003), 171-185) a new mathematical framework for studying domination is presented. It is shown that the domination number and many domination related parameters can be interpreted as restricted 2-stratifications or 2-colorings. This framework places the domination number in a new perspective and suggests many other parameters of a graph which are related in some way to the domination number. In this thesis, we continue this study of domination and stratification in graphs. Let F be a 2-stratified graph with one fixed blue vertex v specified. We say that F is rooted at the blue vertex v. An F-coloring of a graph G is a red-blue coloring of the vertices of G such that every blue vertex v of G belongs to a copy of F (not necessarily induced in G) rooted at v. The F-domination number yF(GQ of G is the minimum number of red vertices of G in an F-coloring of G. Chapter 1 is an introduction to the chapters that follow. In Chapter 2, we investigate the X-domination number of prisms when X is a 2-stratified 4-cycle rooted at a blue vertex where a prism is the cartesian product Cn x K2, n > 3, of a cycle Cn and a K2. In Chapter 3 we investigate the F-domination number when (i) F is a 2-stratified path P3 on three vertices rooted at a blue vertex which is an end-vertex of the F3 and is adjacent to a blue vertex and with the remaining vertex colored red. In particular, we show that for a tree of diameter at least three this parameter is at most two-thirds its order and we characterize the trees attaining this bound. (ii) We also investigate the F-domination number when F is a 2-stratified K3 rooted at a blue vertex and with exactly one red vertex. We show that if G is a connected graph of order n in which every edge is in a triangle, then for n sufficiently large this parameter is at most (n — /n)/2 and this bound is sharp. In Chapter 4, we further investigate the F-domination number when F is a 2- stratified path P3 on three vertices rooted at a blue vertex which is an end-vertex of the P3 and is adjacent to a blue vertex with the remaining vertex colored red. We show that for a connected graph of order n with minimum degree at least two this parameter is bounded above by (n —1)/2 with the exception of five graphs (one each of orders four, five and six and two of order eight). For n > 9, we characterize those graphs that achieve the upper bound of (n — l)/2. In Chapter 5, we define an f-coloring of a graph to be a red-blue coloring of the vertices such that every blue vertex is adjacent to a blue vertex and to a red vertex, with the red vertex itself adjacent to some other red vertex. The f-domination number yz{G) of a graph G is the minimum number of red vertices of G in an f-coloring of G. Let G be a connected graph of order n > 4 with minimum degree at least 2. We prove that (i) if G has maximum degree A where A 4 with maximum degree A where A 5 with maximum degree A where
- …