0 votes 0 votes $1)$ Is there any general formula for maximum degree (if possible also minimum degree) of a vertex in a graph G? $2)$ Is there any relationship between indegree and outdegree of a graph? Graph Theory graph-theory discrete-mathematics general + – srestha asked Sep 25, 2018 srestha 518 views answer comment Share Follow See all 10 Comments See all 10 10 Comments reply Show 7 previous comments Shaik Masthan commented Sep 25, 2018 reply Follow Share is your formula for what? (simple graphs) or (simple graphs + self loop) or (Multigraph) ? Directed or Undirected ? 0 votes 0 votes Magma commented Sep 25, 2018 reply Follow Share Sum of all In-degree in a graph = | E(G) | = Sum of all Out-Degree [because every edge is going to add 1 to this sum] srestha Mam , where you have doubt in this property ??? 0 votes 0 votes Magma commented Sep 25, 2018 reply Follow Share This is a generic property which holds in every simple directed graph 0 votes 0 votes Please log in or register to add a comment.