About
I am an nth year graduate student in the Department of Electrical Engineering at Indian Institute of Technology Kanpur. This small webspace details my academic life, research and teaching. My primary academic interests are Algorithms, Graph Theory, Queueing Theory, Network Theory and Network Algorithms. If you want to get in touch with me regarding anything that has to do with any of the mentioned research areas, please have a look at the contact page. Among all means of communication, email is the one that gets my response quickest.
Now that you've known my story, and that's the only story I've, the one mentioned in the previous paragraph, you would like to get some better things done with your time. If you're curious about the pentagon at the top of the page, here are some details about it.
The Peterson Graph
The graph shown in the header of this page, called “Peterson Graph” --named after Julius Peterson,-- is an undirected graph with 10 vertices and 15 edges. It has the radius 2, diameter 2, girth 5, chromatic number 3, edge chromatic number 4 and crossing number 2.
For any graph to be planar, it must not have the complete graph K5 or the complete bipartite graph K3,3 as its minor. Peterson Graph has both of these as minors.
Thank you for your interest!