The n most vital nodes in a network are those n nodes whose removal, along with all arcs incident with them, would cause the greatest decrease in maximum flow between a specified node pair. Results are established for this problem that lead to a procedure for determining the n most vital nodes.