• No results found

Connected total dominating set

The Upper Total Edge Domination Number of a Graph

The Upper Total Edge Domination Number of a Graph

... a connected graph of order . The total edge dominating set in a connected graph is called a minimal total edge dominating set if no proper subset of is a ...

6

Paired, Total, and Connected Domination on the Queen’s Graph Revisited

Paired, Total, and Connected Domination on the Queen’s Graph Revisited

... a set of queens is a connected dominating set if and only if every square on our board is attacked or occupied, and given any two vertices corresponding to occupied squares there exists a path ...

6

Application oriented connected dominating set-based cluster formation in wireless sensor networks

Application oriented connected dominating set-based cluster formation in wireless sensor networks

... the CDS results in a significant reduction in message over- head associated with routing updates. Reduction in the num- ber of active nodes reduces the end-to-end delay between the Sink and sensor nodes. Most of the ...

16

Connected Total Global Domination in Fuzzy Graphs

Connected Total Global Domination in Fuzzy Graphs

... A set S V in a fuzzy graph G is said to beindependent if  (u ,v) <(u) (v) for all u ,v  ...A dominating set is called anindependent dominating set if D is ...independent ...

6

Minimum Connected Dominating Set based Virtual Backbone Construction in OLSR Protocol

Minimum Connected Dominating Set based Virtual Backbone Construction in OLSR Protocol

... smaller set of MPRs that give better QoS paths between any two nodes is determined with the aim of maximizing the QoS effect for a given maintenance ...the total number of nodes selected as MPRs is ...

9

Vol 7, No 11 (2016)

Vol 7, No 11 (2016)

... minimum connected co-total dominating set of G, then |𝐷𝐷| = 𝛾𝛾 𝑐𝑐𝑐𝑐𝑐𝑐 (𝐺𝐺) ...a connected co-total dominating set, there exist a vertex 𝑣𝑣 ∈ 𝐷𝐷 and 𝑢𝑢𝑣𝑣 ∈ 𝐸𝐸(𝐺𝐺) ...

5

New Distributed Algorithm for Connected Dominating Set in Wireless Ad Hoc Networks

New Distributed Algorithm for Connected Dominating Set in Wireless Ad Hoc Networks

... entire set of its neighbors, and after receiving this adjacency information from all neighbors it declares itself as dominator if and only if it has two nonadjacent ...the total message complexity is O ( n ...

7

International Journal of Scientific Research and Reviews The Upper Total Edge Domination Number of a Graph

International Journal of Scientific Research and Reviews The Upper Total Edge Domination Number of a Graph

... The total edge dominating set in a connected graph is called a minimal total edge dominating set if no proper subset of is a total edge dominating set ...

6

Constructing MICDS Algorithm for Data Transmission using Maximal Independent Set in Network Graph

Constructing MICDS Algorithm for Data Transmission using Maximal Independent Set in Network Graph

... balanced connected dominating set (DGAEBCDS) for data collection in wireless sensor ...the total message complexity of the algorithm is (𝑛 log 𝑛), and also show that DGA-EBCDS can reduce ...

6

Vol 9, No 1 (2018)

Vol 9, No 1 (2018)

... domination, total domination, connected domination have been ...pendent dominating set, complementary pendent dominating set, isolate dominating set, doubly isolate ...

6

On (1,2)  Blast Domination Number for Some Total Graphs

On (1,2) Blast Domination Number for Some Total Graphs

... Blast dominating set having property that, for every vertex in , there is at least one vertex in at distance 1 from and a second vertex in at distance almost 2 from and also is a connected ...

5

The Forcing Monophonic Hull Domination Number of a Graph

The Forcing Monophonic Hull Domination Number of a Graph

... monophonic hull dominating sets M in G. Some general properties satisfied by this concept is studied. The monophonic hull domination number of certain standard graphs are determined.. The forcing monophonic hull ...

9

Dominating and Total Dominating Complementary Color Transversal number of Graphs

Dominating and Total Dominating Complementary Color Transversal number of Graphs

... (Minimum dominating complementary color transversal set/ dominating complementary color transversal number) Let G = (V, E) be a ...minimum dominating complementary color transversal set ...

6

Vol 9, No 5 (2018)

Vol 9, No 5 (2018)

... The concept of fuzzy graph was proposed by Zadeh.L. A [8]. Although, In 1975, Rosenfeld introduced another elaborated concept, including fuzzy vertex and fuzzy edges and several fuzzy analogues of graph theoretic ...

5

The Disjoint Total Domination Number of a Graph

The Disjoint Total Domination Number of a Graph

... disjoint total domination number of a graph G is the minimum cardinality of the union of two disjoint total dominating sets in ...a dominating set and a total dominating ...

6

The Dominating Set of Bergman Spaces

The Dominating Set of Bergman Spaces

... Next we will study some applications of Theorem 11. Let φ be a bounded measurable function on  . So we want to prove that the Toeplitz operator T φ is bounded. Using dominating set and Carleson measures, ...

12

Ant Colony Optimization Algorithm with Pheromone Correction Strategy for the Minimum Connected Dominating Set Problem

Ant Colony Optimization Algorithm with Pheromone Correction Strategy for the Minimum Connected Dominating Set Problem

... minimum connected dominating set problem (MCDSP) is ...Minimum connected dominat- ing set problem, Swarm intelligence, Optimization ...

18

Algorithms for Finding an Efficient Dominating Set of an Interval Graphand a Split Dominating Set of a Circular-Arc Graph

Algorithms for Finding an Efficient Dominating Set of an Interval Graphand a Split Dominating Set of a Circular-Arc Graph

... efficient dominating set of an interval family if it exists and Also an algorithm for finding a non- split dominating set of circular-arc ...

8

Connected Domination Number of Fuzzy Digraphs

Connected Domination Number of Fuzzy Digraphs

... fuzzy set theory, there are different types of fuzzy graphs which may be a graph with crisp vertex set and fuzzy edge set or fuzzy vertex set and crisp edge set or fuzzy vertex ...

5

Restrained Triple Connected Domination Number of Cardinal, Strong and Equivalent Products of Graphs

Restrained Triple Connected Domination Number of Cardinal, Strong and Equivalent Products of Graphs

... triple connected domination number of the product of path graphs as cardinal, strong and equivalent ...restrained dominating set is said to be restrained triple connected dominating ...

7

Show all 10000 documents...

Related subjects