Please use this identifier to cite or link to this item:
https://www.um.edu.mt/library/oar/handle/123456789/24491| Title: | Subgraphs |
| Authors: | Burlo, Arthur |
| Keywords: | Mathematics -- Periodicals Proof theory |
| Issue Date: | 2001 |
| Publisher: | University of Malta. Department of Mathematics |
| Citation: | Burlo, A. (2001). Subgraphs. The Collection, 3, 19. |
| Abstract: | Let H be a graph and K be a subgraph of H. Let n(G) denote the number of vertices of a graph C and k(G) denote the number of components of G. Then n(K) - k(K) < n(H) - k(H). |
| URI: | https://www.um.edu.mt/library/oar//handle/123456789/24491 |
| Appears in Collections: | Collection, No.3 Collection, No.3 |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| Subgraphs.pdf | 36.23 kB | Adobe PDF | View/Open |
Items in OAR@UM are protected by copyright, with all rights reserved, unless otherwise indicated.