Please use this identifier to cite or link to this item:
/library/oar/handle/123456789/28361| Title: | Triangles in inverse NSSD graphs |
| Authors: | Farrugia, Alexander Sciriha, Irene |
| Keywords: | Mathematics -- Charts, diagrams, etc. Mathematics -- Problems, exercises, etc. |
| Issue Date: | 2017 |
| Publisher: | Taylor & Francis |
| Citation: | Farrugia, A., & Sciriha, I. (2017). Triangles in inverse NSSD graphs. Linear and Multilinear Algebra, 66(3). |
| Abstract: | A nonsingular graph with a singular deck, or NSSD, is an edge-weighted graph with all the diagonal entries of its adjacency matrix G and of the inverse G-1 equal to zero. We obtain necessary and sufficient conditions for a two-vertex-deleted subgraph of an NSSD G to remain an NSSD by considering triangles in the inverse NSSD G-1 whose adjacency matrix is G-1. We also consider the graph obtained by introducing terminal vertices to the NSSD G and show that the conditions for it to be an NSSD are associated with the conditions deduced for the two-vertex deleted subgraph. |
| URI: | https://www.um.edu.mt/library/oar//handle/123456789/28361 |
| Appears in Collections: | Scholarly Works - FacSciMat Scholarly Works - JCMath |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| Triangles_in_inverse_NSSD_graphs_2017.pdf Restricted Access | 909.92 kB | Adobe PDF | View/Open Request a copy |
Items in OAR@UM are protected by copyright, with all rights reserved, unless otherwise indicated.