“spanning subgraph”簡單造句，spanning subgraph造句子

We call such a spanning subgraph T an economical spanning subgraph.

In this paper we proved that every near triangulation without separating triangles has a 2-connected spanning subgraph of maximum degree at most 3 which is the best possible.

A well known problem in optimization theory asks for a relatively easy way of finding a spanning subgraph with a special property.