JETIREXPLORE- Search Thousands of research papers



Published in:

Volume 7 Issue 6
June-2020
eISSN: 2349-5162

Unique Identifier

JETIR2006267

Page Number

1853-1856

Share This Article


Title

Inverse Domination in Interval Graphs

ISSN

2349-5162

Cite This Article

"Inverse Domination in Interval Graphs", International Journal of Emerging Technologies and Innovative Research (www.jetir.org), ISSN:2349-5162, Vol.7, Issue 6, page no.1853-1856, June-2020, Available :http://www.jetir.org/papers/JETIR2006267.pdf

Abstract

A dominating set for a graph G=(V,E) is a subset of V such that every vertex not in D is adjacent to at least one member of D. The domination number gamma(G) is the number of vertices in a smallest dominating set of G . In this paper we write an algorithm to find inverse dominating set of an interval family.

Key Words

Inverse Dominating set, Inverse Domination number,Interval Graph

Cite This Article

"Inverse Domination in Interval Graphs", International Journal of Emerging Technologies and Innovative Research (www.jetir.org | UGC and issn Approved), ISSN:2349-5162, Vol.7, Issue 6, page no. pp1853-1856, June-2020, Available at : http://www.jetir.org/papers/JETIR2006267.pdf

Publication Details

Published Paper ID: JETIR2006267
Registration ID: 234264
Published In: Volume 7 | Issue 6 | Year June-2020
DOI (Digital Object Identifier):
Page No: 1853-1856
ISSN Number: 2349-5162

Download Paper

Preview Article

Download Paper




Cite This Article

"Inverse Domination in Interval Graphs", International Journal of Emerging Technologies and Innovative Research (www.jetir.org | UGC and issn Approved), ISSN:2349-5162, Vol.7, Issue 6, page no. pp1853-1856, June-2020, Available at : http://www.jetir.org/papers/JETIR2006267.pdf




Preview This Article


Downlaod

Click here for Article Preview