Please use this identifier to cite or link to this item:
https://www.um.edu.mt/library/oar/handle/123456789/24435
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.date.accessioned | 2017-12-11T10:15:10Z | - |
dc.date.available | 2017-12-11T10:15:10Z | - |
dc.date.issued | 2004 | - |
dc.identifier.citation | Fiorini, S. (2004). An upper bound for the nullity of trees and edge-colourings. The Collection, 9, 12-16. | en_GB |
dc.identifier.uri | https://www.um.edu.mt/library/oar//handle/123456789/24435 | - |
dc.description.abstract | A necessary and sufficient condition for the non-singularity of the adjacency matrix of a tree is given in terms of the existence of a I-factor in the tree. The result is used to give an upper bound for t.he nullity of the tree via edge-colourings of bipartite graphs. | en_GB |
dc.language.iso | en | en_GB |
dc.publisher | University of Malta. Department of Mathematics | en_GB |
dc.rights | info:eu-repo/semantics/openAccess | en_GB |
dc.subject | Mathematics -- Periodicals | en_GB |
dc.subject | Proof theory | en_GB |
dc.title | An upper bound for the nullity of trees and edge-colourings | en_GB |
dc.type | article | en_GB |
dc.rights.holder | The 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.reviewed | non peer-reviewed | en_GB |
dc.publication.title | The Collection | en_GB |
dc.contributor.creator | Fiorini, Stanley | - |
Appears in Collections: | Collection, No.9 Collection, No.9 |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
an upper bound for the nullity of trees.pdf | 116.86 kB | Adobe PDF | View/Open |
Items in OAR@UM are protected by copyright, with all rights reserved, unless otherwise indicated.