نتایج جستجو برای: signed roman edge k domination number
تعداد نتایج: 1600006 فیلتر نتایج به سال:
A graph is k-domination-critical if γ(G)=k, and for any edge e not in G, γ(G+e) = k-1. In this paper we show that the diameter of a domination k-critical graph with k≥2 is at most 2k-2. We also show that for every k≥2, there is a k-domination-critical graph having diameter 3 2 k 1 − . We also show that the diameter of a 4-domination-critical graph is at most 5.
We consider new variants of the vertex/edge domination problems on graphs. A vertex is said to dominate itself and its all adjacent vertices, and similarly an edge is said to dominate itself and its all adjacent edges. Given an input graph G = (V,E) and an integer k, the k-Vertex (k-Edge) Maximum Domination (k-MaxVD and k-MaxED, respectively) is to find a subset DV ⊆ V of vertices (resp., DE ⊆ ...
Let G = (V, E) be a graph. A function f : V → {−1,+1} defined on the vertices of G is a signed total dominating function if the sum of its function values over any open neighborhood is at least one. The signed total domination number of G, γ t (G), is the minimum weight of a signed total dominating function of G. In this paper, we study the signed total domination number of generalized Petersen...
Abstract. Let G = (V,E) be a simple graph. A function f : V → {−1, 1} is called an inverse signed total dominating function if the sum of its function values over any open neighborhood is at most zero. The inverse signed total domination number of G, denoted by γ0 st(G), equals to the maximum weight of an inverse signed total dominating function of G. In this paper, we establish upper bounds on...
Given a graph G = (V, E), the subdivision of an edge e = uv ∈ E(G) means the substitution of the edge e by a vertex x and the new edges ux and xv. The domination subdivision number of a graph G is the minimum number of edges of G which must be subdivided (where each edge can be subdivided at most once) in order to increase the domination number. Also, the domination multisubdivision number of G...
In this paper we introduce the concept of edge domination and total edge domination in intuitionistic fuzzy graphs. We determine the edge domination number and total edge domination number for several classes of intuitionistic fuzzy graphs and obtain bounds for them. We also obtain Nordhaus gaddum type results for the parameters.
For any k ∈ N, the k-subdivision of a graph G is a simple graph G 1 k , which is constructed by replacing each edge of G with a path of length k. In [Moharram N. Iradmusa, On colorings of graph fractional powers, Discrete Math., (310) 2010, No. 10-11, 1551-1556] the mth power of the n-subdivision of G has been introduced as a fractional power of G, denoted by G m n . In this regard, we investig...
A subset X of edges in a graph G is called an edge dominating set of G if every edge not in X is adjacent to some edge in X. The edge domination number γ′(G) of G is the minimum cardinality taken over all edge dominating sets of G. Let m,n and k be positive integers with n − 1 ≤ m ≤ (n 2 ) , G(m,n) be the set of all non-isomorphic connected graphs of order n and size m, and G(m,n; k) = {G ∈ G(m...
Let G be a graph with the vertex set V (G) and edge set E(G). A function f : E(G) → {−1,+1} is said to be a signed star dominating function ofG if ∑ e∈EG(v) f(e) ≥ 1, for every v ∈ V (G), where EG(v) = {uv ∈ E(G) |u ∈ V (G)}. The minimum of the values of ∑ e∈E(G) f(e), taken over all signed star dominating functions f on G is called the signed star domination number of G and is denoted by γss(G...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید