Please use this identifier to cite or link to this item:
https://www.um.edu.mt/library/oar/handle/123456789/112243
Title: | The class reconstruction number of maximal planar graphs |
Authors: | Harary, Frank Lauri, Josef |
Keywords: | Graph theory Graphic methods Mathematics -- Charts, diagrams, etc. |
Issue Date: | 1987 |
Publisher: | Springer-Verlag |
Citation: | Harary, F., & Lauri, J. (1987). The class reconstruction number of maximal planar graphs. Graphs and Combinatorics, 3, 45-53. |
Abstract: | The reconstruction number rn(G) of a graph G was introduced by Harary and Plantholt as the smallest number of vertex-deleted subgraphs G i = G - vi in the deck of G which do not all appear in the deck of any other graph. For any graph theoretic property P, Harary defined the P- reconstruction number of a graph G ~ P as the smallest number of the G i in the deck of G, which do not all appear in the deck of any other graph in P. We now study the maximal planar graph reconstruction number Mrn(G), proving that its value is either 1 or 2 and characterizing those with value 1. |
URI: | https://www.um.edu.mt/library/oar/handle/123456789/112243 |
Appears in Collections: | Scholarly Works - FacSciMat |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
The_class_reconstruction_number_of_maximal_planar_graphs_1987.pdf Restricted Access | 541.94 kB | Adobe PDF | View/Open Request a copy |
Items in OAR@UM are protected by copyright, with all rights reserved, unless otherwise indicated.