Open Access   Article Go Back

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

A. Sudhakaraiah1 , A. Venkateswarrao2 , T. Venkateswarlu3 , K. Narayana4

Section:Research Paper, Product Type: Journal Paper
Volume-7 , Issue-8 , Page no. 189-201, Aug-2019

CrossRef-DOI:   https://doi.org/10.26438/ijcse/v7i8.189201

Online published on Aug 31, 2019

Copyright © A. Sudhakaraiah, A. Venkateswarrao, T. Venkateswarlu, K. Narayana . This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

View this paper at   Google Scholar | DPI Digital Library

XML View
PDF Download

How to Cite this Paper

  • IEEE Citation
  • MLA Citation
  • APA Citation
  • BibTex Citation
  • RIS Citation

IEEE Style Citation: A. Sudhakaraiah, A. Venkateswarrao, T. Venkateswarlu, K. Narayana, “Sum of The Degrees of Dominating Set And Complementary Dominating Set Using Eulidean Division Algorithm of Divisor 5 For Interval Graph G,” International Journal of Computer Sciences and Engineering, Vol.7, Issue.8, pp.189-201, 2019.

MLA Style Citation: A. Sudhakaraiah, A. Venkateswarrao, T. Venkateswarlu, K. Narayana "Sum of The Degrees of Dominating Set And Complementary Dominating Set Using Eulidean Division Algorithm of Divisor 5 For Interval Graph G." International Journal of Computer Sciences and Engineering 7.8 (2019): 189-201.

APA Style Citation: A. Sudhakaraiah, A. Venkateswarrao, T. Venkateswarlu, K. Narayana, (2019). Sum of The Degrees of Dominating Set And Complementary Dominating Set Using Eulidean Division Algorithm of Divisor 5 For Interval Graph G. International Journal of Computer Sciences and Engineering, 7(8), 189-201.

BibTex Style Citation:
@article{Sudhakaraiah_2019,
author = {A. Sudhakaraiah, A. Venkateswarrao, T. Venkateswarlu, K. Narayana},
title = {Sum of The Degrees of Dominating Set And Complementary Dominating Set Using Eulidean Division Algorithm of Divisor 5 For Interval Graph G},
journal = {International Journal of Computer Sciences and Engineering},
issue_date = {8 2019},
volume = {7},
Issue = {8},
month = {8},
year = {2019},
issn = {2347-2693},
pages = {189-201},
url = {https://www.ijcseonline.org/full_paper_view.php?paper_id=4808},
doi = {https://doi.org/10.26438/ijcse/v7i8.189201}
publisher = {IJCSE, Indore, INDIA},
}

RIS Style Citation:
TY - JOUR
DO = {https://doi.org/10.26438/ijcse/v7i8.189201}
UR - https://www.ijcseonline.org/full_paper_view.php?paper_id=4808
TI - Sum of The Degrees of Dominating Set And Complementary Dominating Set Using Eulidean Division Algorithm of Divisor 5 For Interval Graph G
T2 - International Journal of Computer Sciences and Engineering
AU - A. Sudhakaraiah, A. Venkateswarrao, T. Venkateswarlu, K. Narayana
PY - 2019
DA - 2019/08/31
PB - IJCSE, Indore, INDIA
SP - 189-201
IS - 8
VL - 7
SN - 2347-2693
ER -

VIEWS PDF XML
339 393 downloads 181 downloads
  
  
           

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.

Key-Words / Index Term

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

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).