On Rolf Nevanlinna Prize Winners collaboration graph - III

V. Yegnanarayanan, G.K Umamaheswari


The problem of determining the collaboration graph of co-authors of Paul Erdos is a challenging task. Here we take up this problem for the case of Rolf Nevanlinna Prize Winners.  Even though the number of the prize winners as on date is 8, the collaboration graph has 23 vertices and 48 edges and posses several interesting properties.  In this paper we have obtained this graph and determined standard graph parameters for both this graph and its complement besides probing its structural properties.  Several new results were obtained.

Full Text: PDF

How to Cite this Article:

V. Yegnanarayanan, G.K Umamaheswari, On Rolf Nevanlinna Prize Winners collaboration graph - III, J. Math. Comput. Sci., 3 (2013), 419-455

Copyright © 2013 V. Yegnanarayanan, G.K Umamaheswari. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.


Copyright ©2024 JMCS