Please use this identifier to cite or link to this item:
https://www.um.edu.mt/library/oar/handle/123456789/65146| Title: | A reduction procedure for the Colin de Verdière number of a graph |
| Authors: | Mitchell, Lon Sciriha, Irene |
| Keywords: | Graph theory Mathematics Algorithms |
| Issue Date: | 2020 |
| Publisher: | Elsevier |
| Citation: | Mitchell, L., & Sciriha, I. (2020). A reduction procedure for the Colin de Verdière number of a graph. Linear Algebra and its Applications, 596, 36-48. |
| Abstract: | We find the Colin de Verdière number μ for all complete multipartite graphs and show that for any graph G there exists a reduction process that results in a complete multipartite graph H with μ(G) ≤ μ(H). We give examples of the upper bounds that can be obtained via this process. |
| URI: | https://www.um.edu.mt/library/oar/handle/123456789/65146 |
| Appears in Collections: | Scholarly Works - FacSciMat |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| ColinDeVerdiereLonMitchell.pdf Restricted Access | 356.68 kB | Adobe PDF | View/Open Request a copy |
Items in OAR@UM are protected by copyright, with all rights reserved, unless otherwise indicated.