1. OAR@UM
  2. Faculty of Science
  3. Department of Mathematics
  4. Scholarly Works - FacSciMat
Please use this identifier to cite or link to this item: https://www.um.edu.mt/library/oar/handle/123456789/29143
Full metadata record
DC FieldValueLanguage
dc.contributor.authorBarioli, Francesco-
dc.contributor.authorBarrett, Wayne-
dc.contributor.authorButler, Steve-
dc.contributor.authorCioaba, Sebastian M.-
dc.contributor.authorCvetkovic, Dragos-
dc.contributor.authorFallat, Shaun M.-
dc.contributor.authorGodsil, Chris-
dc.contributor.authorHaemers, Willem-
dc.contributor.authorHogben, Leslie-
dc.contributor.authorMikkelson, Rana-
dc.contributor.authorNarayan, Sivaram-
dc.contributor.authorPryporova, Olga-
dc.contributor.authorSciriha, Irene-
dc.contributor.authorSo, Wasin-
dc.contributor.authorStevanovic, Dragan-
dc.contributor.authorHolst van der, Hein-
dc.contributor.authorMeulen Vander, Kevin-
dc.contributor.authorWangsness Wehe, Amy-
dc.date.accessioned2018-04-13T14:24:10Z-
dc.date.available2018-04-13T14:24:10Z-
dc.date.issued2008-
dc.identifier.citationAIM Minimum Rank – Special Graphs Work Group. (2008). Zero forcing sets and the minimum rank of graphs. Linear Algebra and its Applications, 428(7), 1628-1648.en_GB
dc.identifier.urihttps://www.um.edu.mt/library/oar//handle/123456789/29143-
dc.description.abstractThe minimum rank of a simple graph G is defined to be the smallest possible rank over all symmetric real matrices whose ijth entry (for ) is nonzero whenever is an edge in G and is zero otherwise. This paper introduces a new graph parameter, , that is the minimum size of a zero forcing set of vertices and uses it to bound the minimum rank for numerous families of graphs, often enabling computation of the minimum rank.en_GB
dc.language.isoenen_GB
dc.publisherElsevier Inc.en_GB
dc.rightsinfo:eu-repo/semantics/restrictedAccessen_GB
dc.subjectSymmetric operatorsen_GB
dc.subjectMatricesen_GB
dc.subjectMathematics -- Problems, exercises, etcen_GB
dc.titleZero forcing sets and the minimum rank of graphsen_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.contributor.corpauthorAIM Minimum Rank – Special Graphs Work Groupen_GB
dc.description.reviewedpeer-revieweden_GB
dc.identifier.doi10.1016/j.laa.2007.10.009-
dc.publication.titleLinear Algebra and its Applicationsen_GB
Appears in Collections:Scholarly Works - FacSciMat

Files in This Item:
File Description SizeFormat 
Zero_forcing_sets_and_the_minimum_rank_of_graphs_2008.pdf
  Restricted Access		239.7 kBAdobe PDFView/Open Request a copy
Show simple item record Statistics


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