On Fixed Edges and Edge-Reconstruction of Series-Parallel Networks

被引：0
|
作者：
Hongbing Fan
Yu-Liang Wu
C. K. Wong
机构：
[1]  Department of Computer Science,
[2] University of Victoria,undefined
[3] Victoria BC,undefined
[4] V8W 3P6 Canada,undefined
[5]  Department of Computer Science and Engineering,undefined
[6] The Chinese University of Hong Kong. ,undefined
[7]  Department of Computer Science and Engineering,undefined
[8] The Chinese University of Hong Kong. e-mail: wongck@cse.cuhk.edu.hk,undefined
来源：
Graphs and Combinatorics | 2001年 / 17卷
关键词：
Forced Edge;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
 An edge e of a graph G is said to be a fixed edge if G−e+e′≅G implies that e′=e, and a forced edge if G−e+e′ is an edge-reconstruction of G implies that e′=e. In this paper, we use the method of excludable configurations to investigate the fixed edges and the forced edges of series-parallel networks. It is proved that all series-parallel networks contain fixed edges except P3∨K1 and P4∨K1, and that all series-parallel networks are edge-reconstructible.
引用
收藏
页码：213 / 225
页数：12
相关论文
共 50 条
12345