DSpace Repository
Shortest distance between two vertices in connected graph using TJ – adjacency of vertices and minimum dominating set
JavaScript is disabled for your browser. Some features of this site may not work without it.
| dc.contributor.author | Bhatt, Tushar | |
| dc.contributor.author | Zalavadiya, Jayesh | |
| dc.contributor.author | Teraiya, Om | |
| dc.date.accessioned | 2023-05-20T03:54:48Z | |
| dc.date.available | 2023-05-20T03:54:48Z | |
| dc.date.issued | 2018-12 | |
| dc.identifier.citation | Bhatt, T. , Zalavadia, J. , Teraiya, O.(2018). Shortest distance between two vertices in connected graph using TJ – adjacency of vertices and minimum dominating set. Journal of Emerging Technologies and Innovative Research (JETIR), Volume 5, Issue 12, (ISSN-2349-5162), www.jetir.org | en_US |
| dc.identifier.issn | 2349-5162 | |
| dc.identifier.uri | http://10.9.150.37:8080/dspace//handle/atmiyauni/1032 | |
| dc.description.abstract | Domination theory is a part of Graph theory is used for finding communities in networks, device for modeling, 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 | en_US |
| dc.language.iso | en | en_US |
| dc.publisher | Journal of Emerging Technologies and Innovative Research (JETIR) | en_US |
| dc.subject | Shortest distance between two vertices | en_US |
| dc.subject | Connected graph | en_US |
| dc.subject | Dominating set, Minimal dominating set | en_US |
| dc.subject | minimum dominating set | en_US |
| dc.subject | Domination number | en_US |
| dc.subject | Dijkstra’s algorithm | en_US |
| dc.title | Shortest distance between two vertices in connected graph using TJ – adjacency of vertices and minimum dominating set | en_US |
| dc.type | Article | en_US |
