Please use this identifier to cite or link to this item: https://www.um.edu.mt/library/oar/handle/123456789/28283
Full metadata record
DC FieldValueLanguage
dc.contributor.authorFarrugia, Alexander-
dc.contributor.authorGauci, John Baptist-
dc.contributor.authorSciriha, Irene-
dc.date.accessioned2018-03-26T11:59:44Z-
dc.date.available2018-03-26T11:59:44Z-
dc.date.issued2016-
dc.identifier.citationFarrugia, A., Gauci, J. B., & Sciriha, I. (2016). Complete graphs with zero diagonal inverse. Ars Mathematica Contemporanea, 11(2), 231-245.en_GB
dc.identifier.issn18553966-
dc.identifier.urihttps://www.um.edu.mt/library/oar//handle/123456789/28283-
dc.description.abstractIf the inverse of a non-singular real symmetric matrix that represents an edge-weighted graph with no loops has zero diagonal, then the inverse itself is the matrix of a loopless graph. Here we show that such graphs having non-zero weight on each edge always exist if their number of vertices is at least 6.en_GB
dc.language.isoenen_GB
dc.publisherSociety of Mathematicians, Physicists and Astronomers of Sloveniaen_GB
dc.rightsinfo:eu-repo/semantics/openAccessen_GB
dc.subjectComplete graphsen_GB
dc.subjectMathematicsen_GB
dc.titleComplete graphs with zero diagonal inverseen_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.titleArs Mathematica Contemporaneaen_GB
Appears in Collections:Scholarly Works - FacSciMat

Files in This Item:
File Description SizeFormat 
639-4385-1-PB (1)_AMC_NSSD_Complete.pdf251.05 kBAdobe PDFView/Open


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