International Research journal of Management Science and Technology

  ISSN 2250 - 1959 (online) ISSN 2348 - 9367 (Print) New DOI : 10.32804/IRJMST

Impact Factor* - 6.2311


**Need Help in Content editing, Data Analysis.

Research Gateway

Adv For Editing Content

   No of Download : 91    Submit Your Rating     Cite This   Download        Certificate

PATHS AND CONNECTION

    1 Author(s):  DR. BAIDYANATH YADAV

Vol -  11, Issue- 1 ,         Page(s) : 165 - 169  (2020 ) DOI : https://doi.org/10.32804/IRJMST

Abstract

A walk in G is a finite non-null sequence W= , whose terms are alternately vertices and edges, such that, for the ends of are and . We say that W is a walk from and a (Vo, Vk) - walk. The vertices Vo and Vk are called the origin and terminus of W, respectively, and its internal vertices. The integer is the length of W.

Dijkstra, E.W. (1959). A note on two problems in connexion with graphs. Numer. Math., 1, 269-71.
Dreyfus, S.E. (1969). An appraisal of some shortest-path algorithms. Operations Res., 17, 395-412.
Edmonds, J. (1965). Paths, trees and flowers. Canad. J. Math., 17, 449-67

*Contents are provided by Authors of articles. Please contact us if you having any query.






Bank Details