Sum of The Degrees of Dominating Set And Complementary Dominating Set Using Eulidean Division Algorithm of Divisor 5 For Interval Graph G

Authors

  • A Sudhakaraiah Department of Mathematics, Sri Venkateswara University, Tirupati, India -517502
  • A Venkateswarrao Dravidian University, Kuppam, India
  • T Venkateswarlu Department of Mathematics, V. R. College, Nellore, India
  • K Narayana Department of Mathematics, Sri Venkateswara University, Ttirupati, India-517 502

DOI:

https://doi.org/10.26438/ijcse/v7i8.189201

Keywords:

Interval graph, Domination number, complementary dominating set, complementary domination number

Abstract

Interval graphs, their importance over the years can be seen in the increasing number of researchers trying to explore the field. The concept of the domination is a rapidly developing area in Graph Theory. In this paper, we tried to present some relations on the sum of degree of the vertices in dominating set and complementary dominating set using Euclidean division algorithm of divisor 5 for interval graph G.

References

[1]. Sampathkumar E. and Walikar H.B., The connected domination number of graph, J. Math.Phy. Sci.,13, (1979), 607-613.

[2]. Dr.A.Sudhakaraiah, K.Narayana, Dr.T.Venkateswarlu., To Find The Domination Number Towards Quotient Of An Euclidean Division Algorithm Of Devisor 3 Using An Interval Graph G. IJRAR August 2018,Volume 5, Issue 3, Page no: 445-455, ISSN 2348-1269.

[3]. Kulli V.R., Theory of Domination in graphs, Vishva Int Pub. (2010).

[4]. Kulli V.R. and Soner N.D, Complementary edge domination in graphs, Indian j. Of pure applied mathematics, 28(7), (1997), 917-920.

[5]. Hedetniemi S.T. and Laskar R., Bibliography on domination in graphs and some basic definitions of domination parameters, Discrete mathematics , 86, (1990), 257-277.

[6]. Dr. A. Sudhakaraiah, Dr. T. Venkateswarlu, K. Narayana and A. Venkateswararao “To find minimum dominating set using Euclidean division algorithm with Divisor 5 for interval graph G” IJRAR November 2018, Volume 5, Issue 4.

[7]. Dr. A. Sudhakaraiah, Dr. T. Venkateswarlu, K. Narayana and A. Venkateswararao “Some properties on degrees of dominating sets using euclidean division algorithm divisor 5 for interval graph G” Volume 4, Issue 11, November-2018.

[8]. Bondy and Murthy. “Graph Theory with applications”. Macmillan (1976)

[9]. Laskar R C and Walikar H B “ On domination related topics in Graph Theory” in Lecture notes in match 85981, 308-320.

[10]. Ore O “Theory of Graphs” American math Soc Colloq Publ. 38 Providence. RI. (1962).

Downloads

Published

2019-08-31
CITATION
DOI: 10.26438/ijcse/v7i8.189201
Published: 2019-08-31

How to Cite

[1]
S. A, V. A, V. T, and N. K, “Sum of The Degrees of Dominating Set And Complementary Dominating Set Using Eulidean Division Algorithm of Divisor 5 For Interval Graph G”, Int. J. Comp. Sci. Eng., vol. 7, no. 8, pp. 189–201, Aug. 2019.

Issue

Vol. 7 No. 8 (2019): IJCSE August Edition

Section

Research Article

License

Creative Commons License

This work is licensed under a Creative Commons Attribution 4.0 International License.

Authors contributing to this journal agree to publish their articles under the Creative Commons Attribution 4.0 International License, allowing third parties to share their work (copy, distribute, transmit) and to adapt it, under the condition that the authors are given credit and that in the event of reuse or distribution, the terms of this license are made clear.