SOME PROPERTIES ON DEGREES OF DOMINATING SETS USING EUCLIDEAN DIVISION ALGORITHM WITH DIVISOR 5 FOR INTERVAL GRAPH G

Dr. A. Sudhakaraiah
S.V.University, Tirupati-517502. A. Venkateswararao1 , Dravidian University, Kuppam. , IN

Dr. T. Venkateswarlu
S.V.University, Tirupati-517502. A. Venkateswararao1 , Dravidian University, Kuppam. , IN

K. Narayana
S.V.University, Tirupati-517502. A. Venkateswararao1 , Dravidian University, Kuppam. , IN

Keywords: Dominating sets, degree, Euclidian division algorithm, interval graph, divisor

Abstract

The aim of this paper is to put forth some revelations regarding the dominating sets of Euclidian division algorithms with devisor five. A connected dominating set is used as back bone for communications and vertices that are not in this set communicate by passing message through neighbors that are in the set. In this some special classes of dominating sets are chosen for this purpose and their properties on degrees of dominating sets using Euclidean division algorithm with divisor 5 for interval graph G

How to Cite

References

NA