The sequence of sizes of single vertex cuts of a graph is called its degree sequence. Is there an agreed-upon name for the sequence of sizes of $k$-vertex cuts? What can be said about two graphs which have the same sequences for all $k
What do we know about general graph degree sequences?
9
$\begingroup$
graph-theory
-
0@Louis: Oh I see. Thank you for the explanation. – 2012-01-24