1·Line 1 of Listing 4 defines a subgraph called cluster_jhuapl.edu.
清单 4 中的行 1 定义了名为 cluster_jhuapl.edu 的子图。
2·Usually this occurs because a subgraph concerns a related set of functionality.
通常这个发生的原因是子图涉及到相关的一套功能。
3·With the increasing demand of massive structured data analysis, mining frequent subgraph patterns from graph datasets has been an attention-deserving field.
随着对大量结构化数据分析需求的增长，从图集合中挖掘频繁子图模式已经成为数据挖掘领域的研究热点。
4·The maximum clique problem (MCP) is a classical graph-theoretic problem, which aims to find the maximum complete subgraph of a given graph G.
最大团问题是一个经典的图论问题，其目标是找出给定的某个图的最大完全子图。
5·In the paper, we prove that the edge number of the Subgraph with maximal edge number of cube graph is equal to the number of 1 in (0,1)-string all integers between 1 and its verter number.
本文中，我们证明了立方图的极大边数子图的边数等于从1到它的点数之间所有正整数的（0，1）——串表示中1的个数。