Most of existing extractive multi-document summarization (MDS) methods score each sentence individually and extract salient sentences one by one to compose a summary, which have two main drawbacks: (1) neglecting both the intra and cross-document relations between sentences; (2) neglecting the coherence and conciseness of the whole summary.In this paper, we propose a novel MDS framework (SgSum) to formulate the MDS task as a sub-graph selection problem, in which source documents are regarded as a relation graph of sentences (e.g., similarity graph or discourse graph) and the candidate summaries are its subgraphs.Instead of selecting salient sentences, SgSum selects a salient sub-graph from the relation graph as the summary.Comparing with traditional methods, our method has two main advantages: (1) the relations between sentences are captured by modeling both the graph structure of the whole document set and the candidate sub-graphs; (2) directly outputs an integrate summary in the form of subgraph which is more informative and coherent.Extensive experiments on MultiNews and DUC datasets show that our proposed method brings substantial improvements over several strong baselines.Human evaluation results also demonstrate that our model can produce significantly more coherent and informative summaries compared with traditional MDS methods.Moreover, the proposed architecture has strong transfer ability from single to multi-document input, which can reduce the resource bottleneck in MDS tasks. 1