IJCATR Volume 6 Issue 2

Center Concepts on Distance k-Dominating Sets

Dr. A. Anto Kinsley V. Annie Vetha Joeshi
10.7753/IJCATR0602.1007
keywords : ontology lifecycle; ontology building; ontology matching; ontology evolution; application ontology

PDF
Semantic interoperability among applications, systems, and services are mostly based on ontology. Its increase usage in Information Systems and knowledge sharing systems raises the importance of ontology development and maintenance. It is essential for sharing information among independent organizations, exchange of information among heterogeneous systems. To make this possible, we need to carefully model the domain knowledge while preserving its semantics. Ontologies are complex in nature and often structured. Their development and maintenance incorporate research areas like: building, evolution, versioning, matching and integration where these are fundamentally different. We uncover the gap in the current research area of ontology building, matching and evolution. We propose a research direction based on ontology construction using knowledge extraction, matching evolution between versions. This paper presents system architecture to manage the lifecycle of the application ontology incorporating building, matching and evolution processes. This solution is integrated in the source ontology since its creation in order to make it possible to evolve and to be versioned.
@artical{d622017ijcatr06021007,
Title = "Center Concepts on Distance k-Dominating Sets",
Journal ="International Journal of Computer Applications Technology and Research(IJCATR)",
Volume = "6",
Issue ="2",
Pages ="106 - 108",
Year = "2017",
Authors ="Dr. A. Anto Kinsley V. Annie Vetha Joeshi "}
  • In this paper, we present the relation between distance k-dominating set and k-center of a graph.
  • We construct a polynomial time algorithm to find a distance k-dominating set using link vector concepts
  • The set D ?V of k vertices (1? k ? n-1) with r_k (G)=i is a distance i-dominating set if and only if D is a k-center.
  • An important theorem, in any graph there exists a vertex whose link vector is full with ?=k if and only if ?_k (G)=1, is proved.