UGC Approved Journal no 63975(19)

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

JETIREXPLORE- Search Thousands of research papers

WhatsApp Contact
Click Here

Published in:

Volume 6 Issue 6
June-2019
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:
JETIR1906K39


Registration ID:
216861

Page Number

330-351

Share This Article


Jetir RMS

Title

DOMINATING, STRONG DOMINATING AND SPLIT STRONG DOMINATING SETS TOWARDS HIGHEST DEGREE OF AN INTERVAL GRAPH USING AN ALGORITHM

Abstract

Abstract: Among the various applications of the theory of dominating sets, strong and split strong dominating sets the most often discussed in a communication networks. Their sincere efforts are observed in establishing the relevance of the subject in practicality in coherence with reality. In this paper we tried to present dominating, strong dominating and split strong dominating sets towards highest degree of an interval graph using an algorithm.

Key Words

Key words: Interval family, interval graph, degree of vertices, dominating set, strong dominating set, split strong dominating sets.

Cite This Article

"DOMINATING, STRONG DOMINATING AND SPLIT STRONG DOMINATING SETS TOWARDS HIGHEST DEGREE OF AN INTERVAL GRAPH USING AN ALGORITHM", International Journal of Emerging Technologies and Innovative Research (www.jetir.org), ISSN:2349-5162, Vol.6, Issue 6, page no.330-351, June 2019, Available :http://www.jetir.org/papers/JETIR1906K39.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

"DOMINATING, STRONG DOMINATING AND SPLIT STRONG DOMINATING SETS TOWARDS HIGHEST DEGREE 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.6, Issue 6, page no. pp330-351, June 2019, Available at : http://www.jetir.org/papers/JETIR1906K39.pdf

Publication Details

Published Paper ID: JETIR1906K39
Registration ID: 216861
Published In: Volume 6 | Issue 6 | Year June-2019
DOI (Digital Object Identifier):
Page No: 330-351
Country: SPSR Nellore, Andhrapradesh, India .
Area: Mathematics
ISSN Number: 2349-5162
Publisher: IJ Publication
Published Paper URL :: https://www.jetir.org/view?paper=JETIR1906K39
Published Paper PDF: https://www.jetir.org/papers/JETIR1906K39

Preview This Article


Downlaod

Click here for Article Preview

Download PDF

Downloads

0002825

Print This Page

Current Call For Paper

Volume 11 | Issue 5
May 2024

Call for Paper
Cilck Here For More Info

Jetir RMS