Please use this identifier to cite or link to this item:
https://www.um.edu.mt/library/oar/handle/123456789/65147
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Sciriha, Irene | - |
dc.contributor.author | Mifsud, Xandru | - |
dc.contributor.author | Borg, James L. | - |
dc.date.accessioned | 2020-12-03T09:53:12Z | - |
dc.date.available | 2020-12-03T09:53:12Z | - |
dc.date.issued | 2020 | - |
dc.identifier.citation | Sciriha, I., Mifsud, X., & Borg, J. L. (2020). Nullspace vertex partition in graphs. Journal of Combinatorial Optimization. https://doi.org/10.1007/s10878-020-00624-x | en_GB |
dc.identifier.uri | https://www.um.edu.mt/library/oar/handle/123456789/65147 | - |
dc.description.abstract | The core vertex set of a graph is an invariant of the graph. It consists of those vertices associated with the non-zero entries of the nullspace vectors of a {0, 1}-adjacency matrix. The remaining vertices of the graph form the core-forbidden vertex set. For graphs with independent core vertices, such as bipartite minimal configurations and trees, the nullspace induces a well defined three part vertex partition. The parts of this partition are the core vertex set, their neighbours and the remote core-forbidden vertices. The set of the remote core-forbidden vertices are those not adjacent to any core vertex. We show that this set can be removed, leaving the nullity unchanged. For graphs with independent core vertices, we show that the submatrix of the adjacency matrix defining the edges incident to the core vertices determines the nullity of the adjacency matrix. For the efficient allocation of edges in a network graph without altering the nullity of its adjacency matrix, we determine which perturbations make up sufficient conditions for the core vertex set of the adjacency matrix of a graph to be preserved in the process. | en_GB |
dc.language.iso | en | en_GB |
dc.publisher | Springer | en_GB |
dc.rights | info:eu-repo/semantics/restrictedAccess | en_GB |
dc.subject | Graph theory | en_GB |
dc.subject | Mathematics | en_GB |
dc.subject | Mathematical physics | en_GB |
dc.subject | Computer mathematics | en_GB |
dc.subject | Computer science -- Mathematics | en_GB |
dc.title | Nullspace vertex partition in graphs | 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 | peer-reviewed | en_GB |
dc.identifier.doi | 10.1007/s10878-020-00624-x | - |
dc.publication.title | Journal of Combinatorial Optimization | en_GB |
Appears in Collections: | Scholarly Works - FacSciMat |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
NullSpVecPartnSciXandJamesSpringer.pdf Restricted Access | 584.81 kB | Adobe PDF | View/Open Request a copy |
Items in OAR@UM are protected by copyright, with all rights reserved, unless otherwise indicated.