Please use this identifier to cite or link to this item:
https://www.um.edu.mt/library/oar/handle/123456789/28152
Title: | Maximal and extremal singular graphs |
Authors: | Sciriha, Irene |
Keywords: | Mathematics -- Charts, diagrams, etc. Mathematics -- Problems, exercises, etc. |
Issue Date: | 2012 |
Publisher: | Springer New York LLC |
Citation: | Sciriha, I. (2012). Maximal and extremal singular graphs. Journal of Mathematical Sciences, 182(2), 117-125. |
Abstract: | A graph G is singular if the nullspace of its adjacency matrix is nontrivial. Such a graph contains induced subgraphs called singular configurations of nullity 1. We present two algorithms. One is for the construction of a maximal singular nontrivial graph G containing an induced subgraph, which is a singular configuration with the support of a vector in its nullspace as in that of G. The second is for the construction of a nut graph, a graph of nullity one whose null vector has no zero entries. An extremal singular graph of a given order, with the maximal nullity and support, has a nut graph as a maximal singular configuration. |
URI: | https://www.um.edu.mt/library/oar//handle/123456789/28152 |
Appears in Collections: | Scholarly Works - FacSciMat |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
Maximal_and_Extremal_Singular_Graphs_2012.pdf Restricted Access | 205.32 kB | Adobe PDF | View/Open Request a copy |
Items in OAR@UM are protected by copyright, with all rights reserved, unless otherwise indicated.