نتایج جستجو برای: distance dominating set

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

A set S of vertices in a graph G=(V,E) is a dominating set ofG if every vertex of V-S is adjacent to some vertex of S.For an integer k≥1, a set S of vertices is a k-step dominating set if any vertex of $G$ is at distance k from somevertex of S. In this paper, using membership values of vertices and edges in fuzzy graphs, we introduce the concepts of strength of strongestdominating set as well a...

Journal: :transactions on combinatorics 2015
doost ali mojdeh a. sayed-khalkhali hossein abdollahzadeh ahangar yancai zhao

a set $s$ of vertices in a graph $g=(v,e)$ is called a total$k$-distance dominating set if every vertex in $v$ is withindistance $k$ of a vertex in $s$. a graph $g$ is total $k$-distancedomination-critical if $gamma_{t}^{k} (g - x) < gamma_{t}^{k}(g)$ for any vertex $xin v(g)$. in this paper,we investigate some results on total $k$-distance domination-critical of graphs.

A set $S subseteq V(G)$ is a semitotal dominating set of a graph $G$ if it is a dominating set of $G$ andevery vertex in $S$ is within distance 2 of another vertex of $S$. Thesemitotal domination number $gamma_{t2}(G)$ is the minimumcardinality of a semitotal dominating set of $G$.We show that the semitotal domination problem isAPX-complete for bounded-degree graphs, and the semitotal dominatio...

2009
Mark Anderson Robert C. Brigham Julie R. Carrington Richard P. Vitray Jay Yellen

An exponential dominating set of graph G = (V,E) is a subset D ⊆ V such that ∑ w∈D( 1 2 )d(v,w)−1 ≥ 1 for every v ∈ V, where d(v, w) is the distance between vertices v and w. The exponential domination number, γe(G), is the smallest cardinality of an exponential dominating set. Lower and upper bounds for γe(Cm × Cn) are determined and it is shown that limm,n→∞ γe(Cm×Cn) mn ≤ 1 13 . Two connecti...

‎Let $G=(V,E)$ be a graph‎. ‎A subset $Ssubset V$ is a hop dominating set‎‎if every vertex outside $S$ is at distance two from a vertex of‎‎$S$‎. ‎A hop dominating set $S$ which induces a connected subgraph‎ ‎is called a connected hop dominating set of $G$‎. ‎The‎‎connected hop domination number of $G$‎, ‎$ gamma_{ch}(G)$,‎‎‎ ‎is the minimum cardinality of a connected hop‎‎dominating set of $G$...

2015
Colette Johnen

We propose a memory efficient self-stabilizing protocol building distance-k independent dominating sets. A distance-k independent dominating set is a distance-k independent set and a distance-k dominating set. Our algorithm, named SID, is silent; it converges under the unfair distributed scheduler (the weakest scheduling assumption). The protocol SID is memory efficient : it requires only log(2...

Journal: :Australasian J. Combinatorics 2015
S. Lunney Christina M. Mynhardt

A broadcast on a graph G is a function f : V (G) → {0, 1, . . . , diamG} such that f(v) ≤ e(v) (the eccentricity of v) for all v ∈ V (G). The broadcast number of a graph is the minimum value of ∑ v∈V (G) f(v) among all broadcasts f with the property that each vertex of G is within distance f(v) from a vertex v with f(v) > 0. We characterize a class of trees with equal broadcast and domination n...

Journal: :Discussiones Mathematicae Graph Theory 2011
Joanna Raczek

Let G = (V,E) be a graph. The distance between two vertices u and v in a connected graph G is the length of the shortest (u−v) path in G. A set D ⊆ V (G) is a dominating set if every vertex of G is at distance at most 1 from an element of D. The domination number of G is the minimum cardinality of a dominating set of G. A set D ⊆ V (G) is a 2-distance dominating set if every vertex of G is at d...

Journal: :communication in combinatorics and optimization 0
m. dettlaff gdańsk university of technology s. kosari azarbaijan shahid madani university m. lemańska gdańsk university of technology s.m. sheikholeslami azarbaijan shahid madani university

let $g=(v,e)$ be a simple graph. a set $dsubseteq v$ is adominating set of $g$ if every vertex in $vsetminus d$ has atleast one neighbor in $d$. the distance $d_g(u,v)$ between twovertices $u$ and $v$ is the length of a shortest $(u,v)$-path in$g$. an $(u,v)$-path of length $d_g(u,v)$ is called an$(u,v)$-geodesic. a set $xsubseteq v$ is convex in $g$ ifvertices from all $(a, b)$-geodesics belon...

Journal: :communication in combinatorics and optimization 0
m. dettlaff gdańsk university of technology s. kosari azarbaijan shahid madani university m. lemańska gdańsk university of technology s.m. sheikholeslami azarbaijan shahid madani university

let $g=(v,e)$ be a simple graph. a set $dsubseteq v$ is adominating set of $g$ if every vertex in $vsetminus d$ has atleast one neighbor in $d$. the distance $d_g(u,v)$ between twovertices $u$ and $v$ is the length of a shortest $(u,v)$-path in$g$. an $(u,v)$-path of length $d_g(u,v)$ is called an$(u,v)$-geodesic. a set $xsubseteq v$ is convex in $g$ ifvertices from all $(a, b)$-geodesics belon...

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

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