نتایج جستجو برای: connected hop dominating set
تعداد نتایج: 780141 فیلتر نتایج به سال:
This study deals with the forcing subsets of a minimum connected co-independent hop dominating sets in graphs. Bounds or exact values domination numbers graphs resulting from some binary operations such asjoin and corona are determined.Some main results generated this include characterization sets, for these types bounds join
Given a graphG, the k-dominating graph ofG, Dk(G), is defined to be the graph whose vertices correspond to the dominating sets of G that have cardinality at most k. Two vertices in Dk(G) are adjacent if and only if the corresponding dominating sets of G differ by either adding or deleting a single vertex. The graph Dk(G) aids in studying the reconfiguration problem for dominating sets. In parti...
A graph is a homogeneous extension of a tree iff the reduction of all homogeneous sets (sometimes called modules) to single vertices gives a tree. We show that these graphs can be recognized in linear sequential and polylogarithmic parallel time using modular decomposition. As an application of some results on homogeneous sets we present a linear time algorithm computing the vertex sets of the ...
Wireless sensor networks propound an algorithmic research problems for prolonging life of nodes and network. The domination algorithms can address some of fundamental issues related to lifetime problems in ad hoc and sensor networks. Most of the graph domination problems are NP-complete even with unit-disk-graphs. The investigation of the thesis addresses some of lifetime issues in sensor netwo...
Let G = (V,E) be a connected graph, An equitable dominating S of a graph G is called the neighborhood connected equitable dominating set (nced-set) if the induced subgraph 〈Ne(S)〉 is connected The minimum cardinality of a nced-set of G is called the neighborhood connected equitable domination number of G and is denoted by γnce(G). In this paper we initiate a study of this parameter. For any gra...
A graph G is a chordal-k-generalized split graph if G is chordal and there is a clique Q in G such that every connected component in G[V \ Q] has at most k vertices. Thus, chordal-1-generalized split graphs are exactly the split graphs. We characterize chordal-k-generalized split graphs by forbidden induced subgraphs. Moreover, we characterize a very special case of chordal-2-generalized split ...
Let k¿2; n=2+1; and let m0; : : : ; mk−1 each be a multiple of n. The graph Cm0×· · ·×Cmk−1 consists of isomorphic connected components, each of which is (n − 1)-regular and admits of a vertex partition into n smallest independent dominating sets. Accordingly, (independent) domination number of each connected component of this graph is equal to (1=n)th of the number of vertices in it. ? 2001 El...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید