نتایج جستجو برای: signed roman edge k dominating function

تعداد نتایج: 1662242  

Journal: :Australasian J. Combinatorics 2011
Nader Jafari Rad

For a graph G, let f : V (G) → P({1, 2, . . . , k}) be a function. If for each vertex v ∈ V (G) such that f(v) = ∅ we have ∪u∈N(v)f(u) = {1, 2, . . . , k}, then f is called a k-rainbow dominating function (or simply kRDF) of G. The weight, w(f), of a kRDF f is defined as w(f) = ∑ v∈V (G) |f(v)|. The minimum weight of a kRDF of G is called the k-rainbow domination number of G, and is denoted by ...

Journal: :Discrete Applied Mathematics 2009
Dirk Meierling Lutz Volkmann Stephan Zitzen

Let G be a finite and simple graph with vertex set V (G), and let f : V (G) → {−1, 1} be a two-valued function. If ∑ x∈N[v] f (x) ≥ 1 for each v ∈ V (G), where N[v] is the closed neighborhood of v, then f is a signed dominating function on G. A set {f1, f2, . . . , fd} of signed dominating functions on Gwith the property that ∑d i=1 fi(x) ≤ 1 for each x ∈ V (G), is called a signed dominating fa...

ژورنال: پژوهش های ریاضی 2022

Let  be a simple graph with vertex set  and edges set . A set  is a dominating set if every vertex in  is adjacent to at least one vertex  in . An eternal 1-secure set of a graph G is defined as a dominating set  such that for any positive integer k and any sequence  of vertices, there exists a sequence of guards   with  and either  or  and  is a dominating set. If we take a guard on every ver...

2015
Ken Iwaide Hiroshi Nagamochi

An edge dominating set of a graph G = (V,E) is a subset M ⊆ E of edges such that each edge in E \ M is incident to at least one edge in M . In this paper, we consider the parameterized edge dominating set problem which asks us to test whether a given graph has an edge dominating set with size bounded from above by an integer k or not, and we design an O(2.2351)-time and polynomial-space algorit...

Journal: :Discussiones Mathematicae Graph Theory 2013
Mustapha Chellali Nader Jafari Rad

A Roman dominating function (RDF) on a graphG = (V,E) is a function f : V −→ {0, 1, 2} satisfying the condition that every vertex u for which f(u) = 0 is adjacent to at least one vertex v for which f(v) = 2. The weight of an RDF is the value f(V (G)) = ∑ u∈V (G) f(u). An RDF f in a graph G is independent if no two vertices assigned positive values are adjacent. The Roman domination number γR(G)...

Journal: :journal of algorithms and computation 0
p. jeyanthi govindammal aditanar college for women tiruchendur-628 215, tamil nadu, india t. saratha devi department of mathematics, g.venkataswamy naidu college, kovilpatti-628502,tamilnadu,india.

let g be a (p,q) graph. an injective map f : e(g) → {±1,±2,...,±q} is said to be an edge pair sum labeling if the induced vertex function f*: v (g) → z - {0} defi ned by f*(v) = σp∈ev f (e) is one-one where ev denotes the set of edges in g that are incident with a vertex v and f*(v (g)) is either of the form {±k1,±k2,...,±kp/2} or {±k1,±k2,...,±k(p-1)/2} u {±k(p+1)/2} according a...

Journal: :Australasian J. Combinatorics 2017
Alawi Alhashim Wyatt J. Desormeaux Teresa W. Haynes

The complementary prism GG of a graph G is formed from the disjoint union of G and its complement G by adding the edges of a perfect matching between the corresponding vertices of G and G. A Roman dominating function on a graph G = (V,E) is a labeling f : V (G) → {0, 1, 2} such that every vertex with label 0 is adjacent to a vertex with label 2. The Roman domination number γR(G) ofG is the mini...

Journal: :Discussiones Mathematicae Graph Theory 2015
Abdollah Khodkar Babak Samadi Lutz Volkmann

Let G be a graph. A function f : V (G) → {−1, 1} is a signed kindependence function if the sum of its function values over any closed neighborhood is at most k − 1, where k ≥ 2. The signed k-independence number of G is the maximum weight of a signed k-independence function of G. Similarly, the signed total k-independence number of G is the maximum weight of a signed total k-independence functio...

2007
ANTHONY BONATO CHANGPING WANG

We study a signed variant of edge covers of graphs. Let b be a positive integer, and let G be a graph with minimum degree at least b. A signed b-edge cover of G is a function f : E(G) → {−1, 1} satisfying e∈EG(v) f(e) ≥ b for every v ∈ V (G). The minimum of the values of e∈E(G) f(e), taken over all signed b-edge covers f of G, is called the signed b-edge cover number and is denoted by ρb(G). Fo...

Journal: :SIAM J. Comput. 2010
Fedor V. Fomin Petr A. Golovach Daniel Lokshtanov Saket Saurabh

We show that Edge Dominating Set, Hamiltonian Cycle, and Graph Coloring are W [1]-hard parameterized by clique-width. It was an open problem, explicitly mentioned in several papers, whether any of these problems is fixed parameter tractable when parameterized by the clique-width, that is, solvable in time g(k) · nO(1) on n-vertex graphs of clique-width k, where g is some function of k only. Our...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید