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 条

[41] K-edge connected polyhedra on series-parallel graphs
Biha, MD
Mahjoub, AR
OPERATIONS RESEARCH LETTERS, 1996, 19 (02) : 71 - 78
[42] MINIMUM COST FLOW ALGORITHMS FOR SERIES-PARALLEL NETWORKS
BEIN, WW
BRUCKER, P
TAMIR, A
DISCRETE APPLIED MATHEMATICS, 1985, 10 (02) : 117 - 124
[43] GEOMETRIC CHARACTERIZATION OF SERIES-PARALLEL VARIABLE RESISTOR NETWORKS
BRYANT, RE
TYGAR, JD
HUANG, LP
IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS I-FUNDAMENTAL THEORY AND APPLICATIONS, 1994, 41 (11): : 686 - 698
[44] ON THE EDGE-RECONSTRUCTION OF GRAPHS WHICH TRIANGULATE SURFACES
FIORINI, S
LAURI, J
QUARTERLY JOURNAL OF MATHEMATICS, 1982, 33 (130): : 191 - 214
[45] On the edge-reconstruction of graphs embedded in surfaces IV
Zhao, Y
DISCRETE MATHEMATICS, 2003, 263 (1-3) : 331 - 338
[46] OPTIMAL REDUNDANCY ALLOCATION FOR NON SERIES-PARALLEL NETWORKS
BANERJEE, SK
RAJAMANI, K
DESHPANDE, SS
IEEE TRANSACTIONS ON RELIABILITY, 1976, 25 (02) : 115 - 118
[47] Combinatorial Analysis of Growth Models for Series-Parallel Networks
Kuba, Markus
Panholzer, Alois
COMBINATORICS PROBABILITY & COMPUTING, 2019, 28 (04): : 574 - 599
[48] Asymptotic bounds of throughput in series-parallel queueing networks
Univ of Massachusetts, Amherst, United States
Computers and Operations Research, 1995, 22 (10): : 1057 - 1073
[49] The recognition of double Euler trails in series-parallel networks
Ho, TY
Sung, TY
Hsu, LH
Tsai, CH
Hwang, JY
JOURNAL OF ALGORITHMS, 1998, 28 (02) : 216 - 257
[50] REMARK ON A NEW OPERATION FOR ANALYZING SERIES-PARALLEL NETWORKS
KAUFMAN, H
IEEE TRANSACTIONS ON CIRCUIT THEORY, 1963, CT10 (02): : 283 - &

← 1 2 3 4 5 →