V. Ramalatha

Studies on Dominating Sets of I G & C a Graphs Using Algorithms: Some Studies on Dominating Sets of Interval Graphs and Circular-arc Graphs Using Algorithms and Networks V. Ramalatha

Research in graph theory and its applications have increased considerably in recent years. Typically, the elaboration of new theoretical structures has motivated a research for new algorithms compatible with those structures. Rather than the arduous and systematic study of every new concept definable with a graph corresponding Interval graph as well as circular arc graph, the main task for the Mathematician is to eliminate the often arbitrary and Cumbersome definitions,keeping only the ?deep? Mathematical problems. The subject of graph theoreticalgorithms is as old as graph theory itself,which is usually regarded as having started with Euler?s famous solution of the problem of the seven bridges of Konigsberg. An algorithm is named after the 9th century Persian Mathematician Muhammad Musa Al-Khwarizmi,who was part of the royal court in Baghdad and who lived from about 780 to 850. Algorithms are used for calculation,data processing and automated reasoning. Moreprecisely, an algorithm is an effective method expressed as a finite set of well defined instructions for calculating a function. The use of the Algorithm evolved to include all definite procedures for performing tasks.