minimum dominating set code matlab
#1

hi i am nandhini,i am doindg my project in "evaluation of routing performance in manet using domination set" ,plz i need a code for this project,its very urgent.
thanks in advance.
Reply
#2
In graph theory, a dominating set for a graph G = (V, E) is a subset D of V such that every vertex not in D is adjacent to at least one member of D. The domination number γ(G) is the number of vertices in a smallest dominating set for G.

The dominating set problem concerns testing whether γ(G) ≤ K for a given graph G and input K; it is a classical NP-complete decision problem in computational complexity theory (Garey & Johnson 1979). Therefore it is believed that there is no efficient algorithm that finds a smallest dominating set for a given graph.

Figures (a)–© on the right show three examples of dominating sets for a graph. In each example, each white vertex is adjacent to at least one red vertex, and it is said that the white vertex is dominated by the red vertex. The domination number of this graph is 2: the examples (b) and © show that there is a dominating set with 2 vertices, and it can be checked that there is no dominating set with only 1 vertex for this graph.
Dominating sets are closely related to independent sets: an independent set is also a dominating set if and only if it is a maximal independent set, so any maximal independent set in a graph is necessarily also a minimal dominating set. Thus, the smallest maximal independent set is greater in size than the smallest independent dominating set. The independent domination number i(G) of a graph G is the size of the smallest independent dominating set (or, equivalently, the size of the smallest maximal independent set).

The minimum dominating set in a graph will not necessarily be independent, but the size of a minimum dominating set is always less than or equal to the size of a minimum maximal independent set, that is, γ(G) ≤ i .

There are graph families in which a minimum maximal independent set is a minimum dominating set. For example, Allan & Laskar (1978) show that γ(G) = i(G) if G is a claw-free graph.

A graph G is called a domination-perfect graph if γ(H) = i(H) in every induced subgraph H of G. Since an induced subgraph of a claw-free graph is claw-free, it follows that every claw-free graphs is also domination-perfect (Faudree, Flandrin & Ryjáček 1997).
Reply

Important Note..!

If you are not satisfied with above reply ,..Please

ASK HERE

So that we will collect data for you and will made reply to the request....OR try below "QUICK REPLY" box to add a reply to this page
Popular Searches: connected dominating set for sensor network ppt, connected dominating set matlab code, minimum dominating set code matlab, maximal,

[-]
Quick Reply
Message
Type your reply to this message here.

Image Verification
Please enter the text contained within the image into the text box below it. This process is used to prevent automated spam bots.
Image Verification
(case insensitive)

Possibly Related Threads...
Thread Author Replies Views Last Post
  matlab code 1 3,438 31-01-2019, 02:52 PM
Last Post: [email protected]
  underwater optical communication matlab code 0 3,290 02-11-2018, 07:32 PM
Last Post: Guest
  source code for blood group detection in matlab 0 6,363 22-10-2018, 10:59 AM
Last Post: Guest
  hackchina matlab code 0 621 27-09-2018, 10:45 PM
Last Post: Guest
  heart disease prediction system source code for matlab 0 764 27-09-2018, 04:40 PM
Last Post: Guest
  matlab code for echo hiding 1 779 17-08-2018, 07:35 PM
Last Post: Guest
  matlab code for echo hiding 1 710 17-08-2018, 07:34 PM
Last Post: Guest
  download source code of zrp in matlab 0 730 14-08-2018, 02:48 PM
Last Post: Guest
  matlab source code for anomaly detection 0 604 01-08-2018, 08:00 PM
Last Post: Guest
  railway track crack detection using matlab 0 602 31-07-2018, 09:56 AM
Last Post: Guest

Forum Jump: