• No results found

connected total domination number

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

... 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 total edge dominating set of ...

6

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

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

... A non-empty subset of of a graph is said to be (1,2)- 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 ...

5

Total global neighbourhood domination

Total global neighbourhood domination

... the total global neighbourhood domination number, for a connected graph ...a total global neighbourhood dominating set(tgnd-set) of G if and only if D is a total dominating set ...

11

On total domination and total equitable domination in graphs

On total domination and total equitable domination in graphs

... We begin with simple, finite, undirected and connected graph G = (V (G), E(G)). For a vertex v ∈ V (G), the open neighborhood N(v) is defined as N(v) = {u ∈ V (G) : uv ∈ E(G)}. The maximum degree among the ...

6

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

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

... 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 between these ver- tices consisting ...

6

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 total edge dominating set of ...

6

Vol 7, No 11 (2016)

Vol 7, No 11 (2016)

... any connected graph. A subset D of V is called a connected dominating set of G if every vertex 𝑣𝑣 ∈ 𝑉𝑉 − 𝐷𝐷 is adjacent to some vertex in D and < 𝐷𝐷 > is ...A connected dominating set D is said ...

5

Total Domination Number and Chromatic Number of a Fuzzy Graph

Total Domination Number and Chromatic Number of a Fuzzy Graph

... of domination in fuzzy graphs was investigated by ...independent domination, total domination, connected domination and domination in cartesian product and composition of ...

5

Connected Total Global Domination in Fuzzy Graphs

Connected Total Global Domination in Fuzzy Graphs

... of domination in ...The domination number is introduced by cockayne and HedetniemiResenfeld introduced the notion of fuzzy graph and several fuzzy analogs of graph theoretic concepts such as paths, ...

6

Locating Total Domination Number in Strong Product of Two Paths

Locating Total Domination Number in Strong Product of Two Paths

... The strong product of two simple graphs is mentioned in References[11,12]. Given two simple connected graphs G and H, we denoted their strong product by G H . Two vertices ( , ) g h i i and ( g h j , j ) of V G ( ...

7

Some New kinds of Connected Domination in Intuitionistic Fuzzy Graphs

Some New kinds of Connected Domination in Intuitionistic Fuzzy Graphs

... : Connected strong domination number, disconnected strong domination number, total connected strong domination number, total disconnected strong ...

6

Domination Numbers, Chromatic Numbers and Total Domination Numbers of all Powers of Cycles using a Circular Arc Graph G

Domination Numbers, Chromatic Numbers and Total Domination Numbers of all Powers of Cycles using a Circular Arc Graph G

... the domination number of G is (G) = that means the domination number of the graph G is equal to the number of sets each contains 2k+1 ...the domination number of G is (G) ...

9

Graphs with Equal Domination and Independent Domination Number

Graphs with Equal Domination and Independent Domination Number

... The domination in graphs is one of the concepts in graph theory which has attracted many researchers to work on ...of domination models are available in existing literature - Independent domination, ...

6

Fuzzy Topologized Domination In Graphs

Fuzzy Topologized Domination In Graphs

... topologized domination in graphs” is introduced. This topologized domination concept may be applied to different graphs like complete graph, star graph, wheel graph, trees and ...

6

A Study on the Normed Graphs and Disemigraphs

A Study on the Normed Graphs and Disemigraphs

... For the upper bound, let be a vertex with maximum degree in Form a spanning tree of such that every neighbour of in is also a neighbour of in . This will result in a tree with branches in it and hence with at least ...

6

Classification Graphs with Large Strong Roman Domination Number

Classification Graphs with Large Strong Roman Domination Number

... Roman domination is introduced by ...of domination and its parameters dependent, determine the graph that is the number of that parameter is ...with total domination number ...

10

Degree Equitable Domination Number and Independent Domination Number of a Graph

Degree Equitable Domination Number and Independent Domination Number of a Graph

... equitable domination number in ...between domination and degree equitable domination and independent ...the domination number, degree equitable domination number ...

5

Domination and Signed Domination Number of Cayley Graphs

Domination and Signed Domination Number of Cayley Graphs

... In this section p is a prime number and B(1, n) = {k < n : gcd(k, n) = 1}. Lemma 2.1. Let G be a group and H be a proper subgroup of G such that [G : H ] = t. If S = G \ H , then Cay(G : S) is a complete ...

8

Vol 3, No 4 (2012)

Vol 3, No 4 (2012)

... a connected equitable dominating set if the subgraph 〈 〉 D induced by D is ...equitable domination and 2-connected equitable domination in a graph, bounds and exact values for some standard ...

5

Bounds for Domination Parameters in Cayley Graphs on Dihedral Group

Bounds for Domination Parameters in Cayley Graphs on Dihedral Group

... of domination for Cayley graphs has been studied by various authors ...efficient domination number for vertex transitive graphs has been obtained by Jia Huang and Jun-Ming Xu ...perfect ...

6

Show all 10000 documents...

Related subjects