网络视角下处处可断图的构造研究

The Characterizing of the Class of Everywhere Separable Graphs Under the Network Perspective

在讨论图的性质的基础上,主要研究了处处可断图的构造问题。结合图的最大团数、连通度等参数,给出了处处可断图的两类构造方法。将处处可断图拓展到处处可断网络,从网络科学的角度揭示了该类图的新的应用前景。

In this paper, under the discussion of graph properties, we mainly study the problems of graph construction of everywhere separable graphs. Given the graph parameters （such as the maximum clique number and connectivity） of the graph, two methods of structuring an every- where separable graph are obtained. At the same time, we extend an everywhere separable graph to an everywhere separable network. From a point of network, new prospects of this class of graphs are revealed.