Introduction
Bimonthly, started in 1957
Administrator
Shanxi Provincial Education Department
Sponsor
Taiyuan University of Technology
Publisher
Ed. Office of Journal of TYUT
Editor-in-Chief
SUN Hongbin
ISSN: 1007-9432
CN: 14-1220/N
Administrator
Shanxi Provincial Education Department
Sponsor
Taiyuan University of Technology
Publisher
Ed. Office of Journal of TYUT
Editor-in-Chief
SUN Hongbin
ISSN: 1007-9432
CN: 14-1220/N
location: home > paper >
PDFdownloadsize：327KBviewed：download：
The Characterizing of the Class of Everywhere Separable Graphs Under the Network Perspective
DOI:
10.16355/j.cnki.issn1007-9432tyut.2017.01.023
Received:
Accepted:
| Corresponding author | Institute | |
| WU Jian | School of Applied Mathematics, Shanxi University of Finances and Economics |
abstract:
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.
Keywords:
maximum clique; minimal cut; connectivity; complex network