test Browse by Author Names Browse by Titles of Works Browse by Subjects of Works Browse by Issue Dates of Works
       

Advanced Search
Home   
 
Browse   
Communities
& Collections
  
Issue Date   
Author   
Title   
Subject   
 
Sign on to:   
Receive email
updates
  
My Account
authorized users
  
Edit Profile   
 
Help   
About T-Space   

T-Space at The University of Toronto Libraries >
University of Toronto at Scarborough >
Computer and Mathematical Science >
Mathematics >

Please use this identifier to cite or link to this item: http://hdl.handle.net/1807/9468

Title: Isomorphism certificates for undirected graphs
Authors: Molloy, M.
Sedgwick, L.
Issue Date: 2002
Publisher: Elsevier
Citation: Molloy, M. & Sedgwick, L. (2002). Isomorphism certificates for undirected graphs. Discrete Mathematics, 256(1-2), 349-359.
Abstract: For a graph G, we are interested in a minimum-size subgraph of G which, along with an unlabelled copy of G, provides enough information to reconstruct G. We perform a preliminary study of such subgraphs, focusing on the cases where G is a complete tree or a grid.
Description: Link to journal home page http://www.sciencedirect.com/science/journal/0012365X
URI: http://hdl.handle.net/1807/9468
ISSN: 0012-365x
Appears in Collections:Mathematics

Files in This Item:

File Description SizeFormat
isomorphism certificates for undirected graphs.pdf769.47 kBAdobe PDF
View/Open

Items in T-Space are protected by copyright, with all rights reserved, unless otherwise indicated.

uoft