Please use this identifier to cite or link to this item:
https://www.um.edu.mt/library/oar/handle/123456789/109154
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Sciriha, Irene | - |
dc.date.accessioned | 2023-05-04T07:52:06Z | - |
dc.date.available | 2023-05-04T07:52:06Z | - |
dc.date.issued | 1999 | - |
dc.identifier.citation | Sciriha, I. (1999). The two classes of singular line graphs of trees. In 5th Workshop on Combinatorics. Rendiconti del Seminario Matematico Messina, 5(21)(II), 167-180. | en_GB |
dc.identifier.uri | https://www.um.edu.mt/library/oar/handle/123456789/109154 | - |
dc.description.abstract | A graph G is singular if its adjacency matrix A(G) is singular. We consider the multiplicity of the eigenvalue 0 for line graphs LG and show that it is at most one for LT where T is a tree. Moreover, if LT is singular, then T is shown to be even. Furthermore, the Polynomial Reconstruction Conjecture, a variant of Ulam 's Reconstruction Conjecture, is shown to be true for singular line graphs of trees. The analysis gives rise to a partition of singular line graphs of trees into two classes. | en_GB |
dc.language.iso | en | en_GB |
dc.publisher | Universita degli Studi di Messina | en_GB |
dc.rights | info:eu-repo/semantics/restrictedAccess | en_GB |
dc.subject | Graph theory -- Mathematics | en_GB |
dc.subject | Polynomials -- Mathematical models | en_GB |
dc.subject | Bipartite graphs | en_GB |
dc.subject | Eigenvalues -- Data processing | en_GB |
dc.subject | Laplacian matrices | en_GB |
dc.title | The two classes of singular line graphs of trees | en_GB |
dc.type | conferenceObject | 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.bibliographicCitation.conferencename | 5th Workshop on Combinatorics | en_GB |
dc.bibliographicCitation.conferenceplace | Messina, Italy, 08-10/Nov/1999 | en_GB |
dc.description.reviewed | peer-reviewed | en_GB |
Appears in Collections: | Scholarly Works - FacSciMat |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
The two classes of singular line graphs of trees 1999.pdf Restricted Access | 335.77 kB | Adobe PDF | View/Open Request a copy |
Items in OAR@UM are protected by copyright, with all rights reserved, unless otherwise indicated.