Domination Results for the VLVZ Algorithm
More results on weighted independent domination
... independent domination is NP-hard in the class of 2P 3 -free ...independent domination are known only for mP 2 -free graphs for any fixed value of ...
20
The Results on Vertex Domination in Fuzzy Graphs
... domination number γ v for several classes of fuzzy graphs, specially complete fuzzy graph and complete bipartite fuzzy graphs. The bounds is obtained for the vertex domination number of fuzzy graphs. Also ...
20
Some Results on Domination Parameters in Graphs: A Special Reference to 2-Rainbow Edge Domination
... minimal dominating set of G is called domination number of G which is denoted by . The open neighborhood N( of V(G) is the set of vertices adjacent to and the set N[ =N ∪ is the closed neighborhood of For any ...
10
Some New Results for the Queens Domination Problem
... This set of operations forms a group (the dihedral group) under the action of composition. We say that configurations A and B are equivalent if B can be obtaine[r] ...
16
RECENT RESULTS ON THE POWER DOMINATION NUMBERS OF GRAPH PRODUCTS
... power domination problem is to determine the power domination number for each family of ...existing results involving the Cartesian product, direct product and the strong ...
13
Efficient Algorithm for the Paired-Domination Problem in Convex Bipartite Graphs
... Keywords: graph algorithms, paired-domination, con- vex bipartite graphs 1 Introduction The problem of placing monitoring devices in a system such that every site in the system (including the moni- toring devices ...
5
Hardness results and approximation algorithms for (weighted) paired-domination in graphs
... paired- domination can be approximated within a constant ratio if the degree of the graph is bounded by a ...paired- domination in a bounded-degree graph is in ...
9
An O(n)-time Algorithm for the Paired-Domination Problem on Permutation Graphs
... Finally, the following result helps us focus on solutions to the paired-domination problem on permu- tation graphs which are of a particular form, thus enabling us to obtain an efficient algorithm. Lemma ...
15
THE AVERAGE LOWER 2-DOMINATION NUMBER OF WHEELS RELATED GRAPHS AND AN ALGORITHM
... av G ( ) v V G v G V G ∈ γ = γ , where the lower 2-domination number, denoted by γ 2 v ( ) G , of the graph G relative to v is the minimum cardinality of 2-domination set in G that contains the vertex v. ...
10
Domination and Eternal Domination of Jahangir Graph
... the results for all cases of v v i , j when m is even, taking into consideration that the same path can be followed to prove all the possible cases of v v i , j when m is ...
14
The Split Domination, Inverse Domination and Equitable Domination in the Middle and the Central graphs of the Path and the Cycle graphs
... In 1962, ore used the name “dominating set” and “domination number” for the same concept. In 1977, Cockayne and Hedetniemi made an interesting and extensive survey of the results known at that time about ...
6
CiteSeerX — Bottleneck Domination and Bottleneck Independent Domination on Graphs
... In this paper, we will first prove that the BDS problem can be solved in O(nlogn + m) time on weighted general graphs using the binary search technique. Next, we will show that the time-complexity can be reduced to O(n) ...
21
Rainbow domination in the
... of domination in graphs, with its many variations, has been extensively studied (see, for example, [3, 4, 6, 7, 8, ...the domination theme is rainbow domination. There are many results on ...
13
Domination in the Anthropocene
... positive results despite the kind of «crisis- voyeurism» it involves, as it can move travellers to adopt a stronger conservationism (see Heise 2010: ...-otherwise domination will continue to be invisible or ...
15
Improving Results of Differential Evolution Algorithm
... optimisation algorithm for the design of an X-Band antenna for Space Technology 5 Mission [3] adds one more example to depict the ubiquity of optimisation ...
68
On exponential domination of graphs
... Exponential Domination The other variants of classical domination rely solely on the local influence of their respective dominating vertices to dominate neighboring ...Exponential domination is the ...
80
Hn-Domination in Graphs
... the domination number of 𝐺 and denoted by 𝛾(𝐺) ...of domination number of a graph appeared was in ...on domination in graphs like (7, 8, 9, ...fundamental results on hn-domination are ...
6
MORE RESULTS ON COMPLEMENTARY TREE NIL DOMINATION NUMBER OF A GRAPH
... A set D of a graph G = (V, E) is a dominating set, if every vertex in V – D is adjacent to some vertex in D. The domination number γ(G) of G is the minimum cardinality of a dominating set. A dominating set D of a ...
10
DOMINATION AND EDGE DOMINATION IN TREES
... 6. Dorfling M., Goddard W., Henning M. A., Mynhardt C. M. Construction of trees and graphs with equal dominating parameters. Discrete Math., 2006. Vol. 306, No. 21. P. 2647–2654. DOI: 10.1016/j.disc.2006.04.031 7. Meddah ...
6
On PFSE Domination and PFSE-t Domination
... The minimum cardinality of a fuzzy soft edge dominating set is called fuzzy soft edge domination number and is denoted by 1 fs ( G A , V ). Definition 2.17[3] Suppose G A , V is a FSG and T be an FSED set. Then ...
5