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 : 59    Submit Your Rating     Cite This   Download        Certificate

GRAPHS AND SUBGRAPHS

    2 Author(s):  BAIDYANATH YADAV ,DR. K.K. CHOUDHARY

Vol -  9, Issue- 3 ,         Page(s) : 508 - 512  (2018 ) DOI : https://doi.org/10.32804/IRJMST

Abstract

Many real-world situations can conveniently be described by means of a diagram consisting of a set of points together with lines joining certain pairs of these points. For Example, the points could represent people, with lines joining pairs of friends; or the points might be communication centres, with lines representing communication links. Notice that in such diagrams one is mainly interested in whether or not two given points are joined by a line; the manner in which they are joined is immaterial. A mathematical abstraction of situations of this type gives rise to the concept of a graph.

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
Erdos, P. and Gallai, T. (1960). Graphs with prescribed degrees of vertices (Hungarian). Mat. Lapok, 11, 264-74.
Hoffman, A. J. and Singleton, R.R. (1960). On Moore graphs with diameters 2 and 3. IBM J. Res. Develop., 4, 497-504.

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






Bank Details