FAQsVolume 5 Issue 12
December-2018
eISSN: 2349-5162
- Share us
-
-
-
Journal of Emerging Technologies and Innovative Research ( 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
UGC Approved Journal no 63975(19)
ISSN: 2349-5162 | ESTD Year : 2014 Call for Paper
Volume 11 | Issue 5 | May 2024
ISSN: 2349-5162 | ESTD Year : 2014 Call for Paper
Volume 11 | Issue 5 | May 2024
JETIREXPLORE- Search Thousands of research papers
Contact Us Click Here
WhatsApp Contact Click Here
Published in:
UGC and ISSN approved 7.95 impact factor UGC Approved Journal no 63975
Unique Identifier
Published Paper ID:
JETIR1812873
Registration ID:
193974
Page Number
Important Links:
Jetir RMS
Title
Shortest distance between two vertices in connected graph using TJ- adjacency of vertices and minimum dominating set
Abstract
Domination theory is a part of Graph theory is used for finding communities in networks, device for modelling, description of real world network systems such are : Transport, Water, Electricity, Internet and many more. So using the domination theory and it is mixed with operation research techniques we can try to solve short rout problem. In this paper we can try to find the shortest distance between two vertices using the concept of minimal dominating set mechanism.
Key Words
Shortest distance between two vertices, Connected graph, Dominating set, Minimal dominating set, minimum dominating set, Domination number, Dijkstra’s algorithm.
Cite This Article
"Shortest distance between two vertices in connected graph using TJ- adjacency of vertices and minimum dominating set", International Journal of Emerging Technologies and Innovative Research (www.jetir.org), ISSN:2349-5162, Vol.5, Issue 12, page no.444-451, December-2018, Available :http://www.jetir.org/papers/JETIR1812873.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
"Shortest distance between two vertices in connected graph using TJ- adjacency of vertices and minimum dominating set", International Journal of Emerging Technologies and Innovative Research (www.jetir.org | UGC and issn Approved), ISSN:2349-5162, Vol.5, Issue 12, page no. pp444-451, December-2018, Available at : http://www.jetir.org/papers/JETIR1812873.pdf
Publication Details
Published Paper ID: JETIR1812873
Registration ID: 193974
Published In: Volume 5 | Issue 12 | Year December-2018
Page No: 444-451
Country: Rajkot, Gujarat, India .
Area: Mathematics
ISSN Number: 2349-5162
Publisher: IJ Publication
Published Paper URL :: https://www.jetir.org/view?paper=JETIR1812873
Published Paper PDF: https://www.jetir.org/papers/JETIR1812873
Download Paper / Preview Article
Download Paper
Preview This Article
Download PDF
Downloads
0002892
Print This Page
Important Links:
Jetir RMS
