Please use this identifier to cite or link to this item:
https://www.um.edu.mt/library/oar/handle/123456789/111813| Title: | Endvertex-deleted subgraphs |
| Authors: | Lauri, Josef |
| Keywords: | Graph theory Graphic methods Mathematics -- Charts, diagrams, etc. |
| Issue Date: | 1993 |
| Publisher: | Centre for Discrete Mathematics & Computing |
| Citation: | Lauri, J. (1993). Endvertex-deleted subgraphs. Ars Combinatoria, 36, 171-182. |
| Abstract: | We consider two seemingly related problems. The first concerns pairs of graphs G and H containing end vertices (vertices of degree 1) and having the property that, although they are not isomorphic, they have the same collection of endvertex-deleted subgraphs. The second question concerns graphs G containing end vertices and having the property that, although no two endvertices are similar, any two endvertex-deleted subgraphs of G are isomorphic. |
| URI: | https://www.um.edu.mt/library/oar/handle/123456789/111813 |
| Appears in Collections: | Scholarly Works - FacSciMat |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| Endvertex_deleted_subgraphs_1993.pdf Restricted Access | 1.79 MB | Adobe PDF | View/Open Request a copy |
Items in OAR@UM are protected by copyright, with all rights reserved, unless otherwise indicated.