vertex edge dominating set.
ON TOTAL VERTEX-EDGE DOMINATION
... total vertex-edge dominating set (in simply, total ve-dominating set) of G, if S is a ve-dominating set and every vertex of S has a neighbor in S ...
6
Vol 9, No 1 (2018)
... secure edge domination and inverse secure edge domination of an intuitionistic fuzzy graph ...between edge domination number 𝛾 , 𝑠𝑒 (𝐺 ) and inverse secure edge domination number 𝛾 −1 𝑠𝑒 (𝐺) ...
7
Some Bounds of Rainbow Edge Domination in Graphs
... The dominating set of a graph G = (V, E) is the subset S such that every vertex V is either an element of S or is adjacent to some element of ...A dominating set S is a minimal ...
11
Independent Domination Approach
... whose vertex set is V(G)UE(G) , and two vertices are adjacent if they are adjacent edges of G or one is a vertex and other is an edge incident with ...end vertex in G An independent ...
5
International Journal of Scientific Research and Reviews The Upper Total Edge Domination Number of a Graph
... the vertex in . A vertex is an extreme vertex of a graph if < ( )> is ...an edge of a graph with ( ) = 1and ( ) > 1, then we call a pendent edge, a leaf and a support ...the ...
6
End edge domination in sub division of graphs
... an edge dominating set of G , M is ...each vertex x i in M is adjacent to some z j z j u j or v k in G ...the vertex of S G ( ) which is adjacent to both x i and z i in ( ) S ...
12
The Upper Total Edge Domination Number of a Graph
... the vertex in . A vertex is an extreme vertex of a graph if < ( )> is ...an edge of a graph with ( ) = 1and ( ) > 1, then we call a pendent edge, a leaf and a support ...the ...
6
CONNECTED WEIGHT DOMINATING EDGE SET ON S - VALUED GRAPHS
... domination set in graph theory was formalised as a theoritical area in graph theory by ...of edge domination number was introduced by Gupta [3] and Mitchell and ...connected edge domination in graphs ...
10
IJCSMC, Vol. 6, Issue. 1, January 2017, pg.182 – 189 The Edge Domination in Prime Square Dominating Graphs
... . Vertex labeled with is adjacent to all the vertices labeled with composite numbers and is adjacent to all the vertices labeled with prime ...the edge { }.The edge set consisting of ...
8
Theory of Edge Domination in Graphs-A Study
... ―Dominating Set‖ and ―Domination Number‖ which was published in ...of edge dominating set which are being studies along with dominating set where only vertex is ...
9
DOMINATION AND EDGE DOMINATION IN TREES
... on vertex set and on edge set has been defined. Edge dominating set is used to study the behaviour of telephone switching network [5] built to phone calls from one ...
6
THE STRONG (WEAK) VV-DOMINATING SET OF A GRAPH
... each vertex outside the set is dominated by at least one vertex inside the ...minimum dominating set is called as domination number 𝛾(𝐺). Similarly edge domination number 𝛾′(𝐺) ...
10
Perfect edge domination : hard and solvable cases
... perfect edge dominating set of G, and (B,Y,W ) its corresponding coloring of the vertices of ...every vertex of G has black color which implies that P is the trivial perfect edge ...
20
Mixed domination in an M-strong fuzzy graph
... A vertex in a fuzzy graph adjacent to the pendent vertices is called a support of the pendent ...A vertex covering of fuzzy graph G is a subset K of V such that every effective edge of G has at least ...
8
CHROMATIC WEAK DOMATIC PARTITION IN GRAPHS
... Abstract. In a simple graph G, a subset D of V (G) is called a chromatic weak dom- inating set if D is a weak dominating set and χ(< D >) = χ(G). Similar to domatic partition, chromatic weak ...
8
An Energy Based Centrality for Electrical Networks
... We present an energy-based method to estimate centrality in electrical networks. Here the energy between a pair of ver- tices denotes by the effective resistance between them. If there is only one generation and one ...
6
The Forcing Monophonic Hull Domination Number of a Graph
... Theorem 2.3, ≥ 2 and hence Then by Theorem 2.5 (a), G has at least two -sets and so the empty set is not a forcing subset for any -set of G. Since no proper subset of M is a forcing subset of M. Thus no ...
9
A New Technique for Finding Min cut Tree
... In this paper we propose a new approximation algorithm for calculating the min-cut tree of an undirected edge-weighted graph. Our algorithm runs in O(V 2 .logV + V 2 .d), where V is the number of vertices in the ...
7
Edge Vertex Dominating Sets and Edge Vertex Domination Polynomials of Cycles
... Edge-Vertex Dominating Sets of Cycles Let Dev Cn , i be the family of ev-dominating sets of Cn with cardinality i.. We investigate the ev-dominating sets of Cn.[r] ...
14
The Strong Non Split Domination Number of a Jump Graph
... every vertex in V-D is adjacent to exactly one vertex in ...every vertex in D is adjacent to some vertex in ...a vertex u D such that u is adjacent to two or more vertices in ...a ...
6