Small Edge Dominating Sets of Regular Graphs
نویسندگان
چکیده
منابع مشابه
Small Edge Dominating Sets of Regular Graphs
An edge dominating set F of a graph G is a subset of E(G) such that every edge in E(G) \ F is incident with at least one vertex that is an end-point of an edge in F . Edge dominating sets of small cardinality are of interest. We refer to the size of a smallest edge dominating set of a graph G as the edge domination number of G and denote this by β(G). In this paper we improve all current known ...
متن کاملEfficient Dominating and Edge Dominating Sets for Graphs and Hypergraphs
Let G = (V,E) be a graph. A vertex dominates itself and all its neighbors, i.e., every vertex v ∈ V dominates its closed neighborhood N [v]. A vertex set D in G is an efficient dominating (e.d.) set for G if for every vertex v ∈ V , there is exactly one d ∈ D dominating v. An edge set M ⊆ E is an efficient edge dominating (e.e.d.) set for G if it is an efficient dominating set in the line graph...
متن کاملStrength of strongest dominating sets in fuzzy graphs
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...
متن کاملRandomised Algorithms for Finding Small Weakly-Connected Dominating Sets of Regular Graphs
A weakly-connected dominating set, W, of a graph, G, is a dominating set such that the subgraph consisting of V (G) and all edges incident with vertices in W is connected. Finding a small weaklyconnected dominating set of a graph has important applications in clustering mobile ad-hoc networks. In this paper we introduce several new randomised greedy algorithms for finding small weakly-connected...
متن کاملRandomized greedy algorithms for finding small k-dominating sets of regular graphs
A k-dominating set of a graph G is a subset D of the vertices of G such that every vertex of G is either in D or at distance at most k from a vertex in D. It is of interest to find k-dominating sets of small cardinality. In this paper we consider simple randomised greedy algorithms for finding small k-dominating sets of regular graphs. We analyse the average-case performance of the most efficie...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Notes in Theoretical Computer Science
سال: 2004
ISSN: 1571-0661
DOI: 10.1016/j.entcs.2003.12.005