measures for a DAG (directed acyclic graph)? Recently, I want to devise some kernelization (in the framework of parameterized complexity) for problem on DAG. So, find a proper parameter is essential.
Well, is there a measure for the importance of a node (like the cut vertex in undirected graph)? or how separated the DAG is? May be after small amount of edge deletion (or node deletion) the DAG was decomposed into separated components (Better if the components have similar cardinality)?
There are loads of measures of nodes in a DAG you could use.  For example:


How much the removal of node $v$ reduces the max flow from sources to sinks
the betweenness centrality of $v$
the in-degree of $v$ times the out-degree of $v$


The question should not be if there is a measure, but rather which measure is most appropriate.  That depends on the problem you're trying to solve.