UGC Approved Journal no 63975(19)

ISSN: 2349-5162 | ESTD Year : 2014
Call for Paper
Volume 11 | Issue 11 | November 2024

JETIREXPLORE- Search Thousands of research papers



WhatsApp Contact
Click Here

Published in:

Volume 10 Issue 8
August-2023
eISSN: 2349-5162

UGC and ISSN approved 7.95 impact factor UGC Approved Journal no 63975

7.95 impact factor calculated by Google scholar

Unique Identifier

Published Paper ID:
JETIR2308088


Registration ID:
522722

Page Number

a649-a663

Share This Article


Jetir RMS

Title

NON - SPLIT PERFECT ODD VERTICES DOMINATING SET OF AN INTERVAL GRAPH USING AN ALGORITHM

Abstract

Among the various applications of the theory of perfect domination , the most often discussed is communication network. There has been persistent in the algorithmic aspects of interval graphs in past decades spurred much by their numerous applications of interval graphs corresponding to interval families. The research of the domination in graphs has been an evergreen of the graph theory. Its basic concept is the dominating set and the domination number. The theory of domination in graphs was introduced by O. Ore and C. Berge. A survey on results and applications of dominating sets was presented by E.J. Cockayane and S.T. Hedetniemi. Non - split domination in graphs was introduced by V.R. Kulli [5] in 1997. They have studied these parameters for various standard graphs and obtained the bounds for them. The concept of restrained domination was introduced by J.A. Telle and A. Proskurowski , albeit indirectly, as a vertex partitioning problem. One application of domination is that of prisoners and guards. In this chapter, we introduce an algorithm to find a non - split odd vertices perfect dominating set of an interval graph.

Key Words

Interval graph, Dominating set, Non-split dominating set, Perfect dominating set, Perfect odd vertices dominating set.

Cite This Article

"NON - SPLIT PERFECT ODD VERTICES DOMINATING SET OF AN INTERVAL GRAPH USING AN ALGORITHM", International Journal of Emerging Technologies and Innovative Research (www.jetir.org), ISSN:2349-5162, Vol.10, Issue 8, page no.a649-a663, August-2023, Available :http://www.jetir.org/papers/JETIR2308088.pdf

ISSN


2349-5162 | Impact Factor 7.95 Calculate by Google Scholar

An International Scholarly Open Access Journal, Peer-Reviewed, Refereed Journal Impact Factor 7.95 Calculate by Google Scholar and Semantic Scholar | AI-Powered Research Tool, Multidisciplinary, Monthly, Multilanguage Journal Indexing in All Major Database & Metadata, Citation Generator

Cite This Article

"NON - SPLIT PERFECT ODD VERTICES DOMINATING SET OF AN INTERVAL GRAPH USING AN ALGORITHM", International Journal of Emerging Technologies and Innovative Research (www.jetir.org | UGC and issn Approved), ISSN:2349-5162, Vol.10, Issue 8, page no. ppa649-a663, August-2023, Available at : http://www.jetir.org/papers/JETIR2308088.pdf

Publication Details

Published Paper ID: JETIR2308088
Registration ID: 522722
Published In: Volume 10 | Issue 8 | Year August-2023
DOI (Digital Object Identifier):
Page No: a649-a663
Country: TIRUPATI, Andhra Pradesh, India .
Area: Mathematics
ISSN Number: 2349-5162
Publisher: IJ Publication


Preview This Article


Downlaod

Click here for Article Preview

Download PDF

Downloads

000161

Print This Page

Current Call For Paper

Jetir RMS