Huang Zhiqiang, Shao Xuecai. The Reconstruction Theorem for Partilly Labeled Graphs[J]. Journal of Beijing University of Technology, 1988, 14(3): 55-62.
Citation:
Huang Zhiqiang, Shao Xuecai. The Reconstruction Theorem for Partilly Labeled Graphs[J]. Journal of Beijing University of Technology, 1988, 14(3): 55-62.
Huang Zhiqiang, Shao Xuecai. The Reconstruction Theorem for Partilly Labeled Graphs[J]. Journal of Beijing University of Technology, 1988, 14(3): 55-62.
Citation:
Huang Zhiqiang, Shao Xuecai. The Reconstruction Theorem for Partilly Labeled Graphs[J]. Journal of Beijing University of Technology, 1988, 14(3): 55-62.
The Reconstruction Theorem for Partilly Labeled Graphs
A graph G of order p, given the number of edges is proved if p≥5 and five points are not labeled, When other points are labeled, a graph G be reconstructed from four of its principal subgraphs. The number of principal subgraphs in the theorem can't be reduced.
DownLoad: