Applications of Dominating Set of Graph in Computer Networks

Abstract

 The aim of the paper is to impart the importance of graph theoretical concepts and the applications of domination in graphs to various real life situations in the areas of science and engineering. In a graph G = (V, E), a set S ⊆ V(G) is said to be a dominating set of G if every vertex in V–S is adjacent to atleast one vertex in S. A set S ⊆ V(G) is said to be a connected dominating set of G if S is dominating set and also the subgraph <S> induced by S is connected. The research has been carried out extensively in various types of dominating sets. This paper explores mainly on the applications of dominating sets in computer networks.

Authors and Affiliations

A. Sasireka

Keywords

Related Articles

  Synthesis of Novel Methylene Bis

 A novel series of methylene-bis (5-[7-(4-amino-5-sulfanyl-4H-1,2,4-triazoles 1,2,4-triazole-3-thiol and corresponding aryl isothiocyanate.All the synthesized compounds have been tesed for their antibacerial acti...

 BIOMETRIC AUTHENTICATION USING PARTIAL HIERARCHICAL VISUAL CRYPTOGRAPHY

 The importance of a strong authentication is very crucial in almost all applications now. User authentication is a method in which the identity of the individual is verified for accessing certain information .Usin...

 SECURITY PROTECTION FOR MULTI OWNER FIRM

 With the increasing use of digital communication the security of data or the information has been a concern. The proposed secure sharing scheme allows users to upload multiple data pieces to different clouds, maki...

 UNDER DISTORTED GRID VOLTAGE DIRECT POWER CONTROL OF DOUBLY FED INDUCTION GENERATOR

 This paper presents a direct power control strategy for a doubly fed induction generator based wind power By analyzing the six times grid frequency power pulsation produced by the fifth and seventh grid voltag...

 Based on Claim Verification Handling Flood Attacks in Disruption Tolerant Network

 Disruption-Tolerant Networks (DTNs) deliver data to the collection of intermittently connected nodes. In traditional networks, malicious nodes within a DTN may try to attempt a data destruction or delay in transmi...

Download PDF file
  • EP ID EP117255
  • DOI -
  • Views 113
  • Downloads 0

How To Cite

A. Sasireka (30).  Applications of Dominating Set of Graph in Computer Networks. International Journal of Engineering Sciences & Research Technology, 3(1), 170-173. https://europub.co.uk/articles/-A-117255