Please use this identifier to cite or link to this item: https://www.um.edu.mt/library/oar/handle/123456789/28287
Full metadata record
DC FieldValueLanguage
dc.contributor.authorSciriha, Irene-
dc.date.accessioned2018-03-26T12:05:15Z-
dc.date.available2018-03-26T12:05:15Z-
dc.date.issued2007-
dc.identifier.citationSciriha, I. (2007). A characterization of singular graphs. Electronic Journal of Linear Algebra, 16, 451-462.en_GB
dc.identifier.issn10813810-
dc.identifier.urihttps://www.um.edu.mt/library/oar//handle/123456789/28287-
dc.description.abstractCharacterization of singular graphs can be reduced to the non-trivial solutions of a system of linear homogeneous equations Ax = 0 for the 0-1 adjacency matrix A. A graph G is singular of nullity η(G) ≥ 1, if the dimension of the nullspace ker(A) of its adjacency matrix A is η(G). Necessary and sufficient conditions are determined for a graph to be singular in terms of admissible induced subgraphs.en_GB
dc.language.isoenen_GB
dc.publisherInternational Linear Algebra Societyen_GB
dc.rightsinfo:eu-repo/semantics/openAccessen_GB
dc.subjectGraph theoryen_GB
dc.subjectEigenvaluesen_GB
dc.subjectMathematicsen_GB
dc.subjectMatricesen_GB
dc.titleA characterization of singular 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.description.reviewedpeer-revieweden_GB
dc.publication.titleElectronic Journal of Linear Algebraen_GB
Appears in Collections:Scholarly Works - FacSciMat

Files in This Item:
File Description SizeFormat 
ACharofSingGraphs_2007.pdf169.63 kBAdobe PDFView/Open


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