Please use this identifier to cite or link to this item: https://www.um.edu.mt/library/oar/handle/123456789/65146
Full metadata record
DC FieldValueLanguage
dc.contributor.authorMitchell, Lon-
dc.contributor.authorSciriha, Irene-
dc.date.accessioned2020-12-03T09:50:31Z-
dc.date.available2020-12-03T09:50:31Z-
dc.date.issued2020-
dc.identifier.citationMitchell, 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.en_GB
dc.identifier.urihttps://www.um.edu.mt/library/oar/handle/123456789/65146-
dc.description.abstractWe 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.en_GB
dc.language.isoenen_GB
dc.publisherElsevieren_GB
dc.rightsinfo:eu-repo/semantics/restrictedAccessen_GB
dc.subjectGraph theoryen_GB
dc.subjectMathematicsen_GB
dc.subjectAlgorithmsen_GB
dc.titleA reduction procedure for the Colin de Verdière number of a graphen_GB
dc.typearticleen_GB
dc.rights.holderThe copyright of this work belongs to the author(s)/publisher. The rights of this work are as defined by the appropriate Copyright Legislation or as modified by any successive legislation. Users may access this work and can make use of the information contained in accordance with the Copyright Legislation provided that the author must be properly acknowledged. Further distribution or reproduction in any format is prohibited without the prior permission of the copyright holder.en_GB
dc.description.reviewedpeer-revieweden_GB
dc.identifier.doi10.1016/j.laa.2020.03.002-
dc.publication.titleLinear Algebra and its Applicationsen_GB
Appears in Collections:Scholarly Works - FacSciMat

Files in This Item:
File Description SizeFormat 
ColinDeVerdiereLonMitchell.pdf
  Restricted Access
356.68 kBAdobe PDFView/Open Request a copy


Items in OAR@UM are protected by copyright, with all rights reserved, unless otherwise indicated.