Skip to main content
Log in

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

  • Published:
Graphs and Combinatorics Aims and scope Submit manuscript

Abstract.

 An edge e of a graph G is said to be a fixed edge if Ge+e G implies that e =e, and a forced edge if Ge+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 P 3K 1 and P 4K 1, and that all series-parallel networks are edge-reconstructible.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Author information

Authors and Affiliations

Authors

Additional information

Received: December 22, 1997 Final version received: July 21, 1999

Rights and permissions

Reprints and permissions

About this article

Cite this article

Fan, H., Wu, YL. & Wong, C. On Fixed Edges and Edge-Reconstruction of Series-Parallel Networks. Graphs Comb 17, 213–225 (2001). https://doi.org/10.1007/PL00007242

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/PL00007242

Keywords

Navigation