Collaboration Graph on Abel’s Prize Winners
G.K.Yogambiga1, N.Srinivasan2

1G.K.Yogambiga*, Department of mathematics, Panimalar engineering College and Research scholar in SPIHER , Chennai, India.
2N.Srinivasan*, Professor and Head, Department of mathematics, SPIHER , Chennai, India.
Manuscript received on April 11, 2020. | Revised Manuscript Received on April 15, 2020. | Manuscript published on April 15, 2020. | PP: 130-133 | Volume-4 Issue-8, April 2020. | Retrieval Number: H0823044820/2020©BEIESP | DOI: 10.35940/ijmh.H0823.044820

Open Access | Ethics and Policies | Cite
© The Authors. Published By: Blue Eyes Intelligence Engineering and Sciences Publication (BEIESP). This is an open access article under the CC BY-NC-ND license (

Abstract: Graph theory plays significant role in various fields. Collaboration graph is the one of the important area in Graph theory. Here, we constructed a collaboration graph centered at Paul Erdős for Abel’s Prize Winners. Though the number of the prize winners as on 2019 is 20, the collaboration graph has 47 vertices and 87edges and gives some properties. Finally ,we have analyzed different parameters of the graph like k-neighbors, closest vertices and etc.
Keywords: Graph theory ,Collaboration graph , Abel’s Prize Winners , k-neighbors, closest vertices, Paul Erdős.