Doubt on Graph on DFS
Graph edges are not "converted to function calls". DFS is a recursive function. When you call DFS on some start node, it looks at the adjacent vertices (vertices which are connected to this node via an edge) and recursively calls itself on one of them. 
But since each node is only visited once in a DFS, the maximum stack size cannot be greater than the number of nodes.