Please use this identifier to cite or link to this item:
https://www.um.edu.mt/library/oar/handle/123456789/95127| Title: | Graphs with maximum singularity |
| Authors: | Gutman, Ivan Sciriha, Irene |
| Keywords: | Mathematics -- Charts, diagrams, etc. Mathematics -- Problems, exercises, etc. Graph theory Matrices |
| Issue Date: | 1996 |
| Publisher: | Mathematical Association of America |
| Citation: | Gutman, I., & Sciriha, I. (1996). Graphs with maximum singularity. Graph Theory Notes of New York, 30, 17-20. |
| Abstract: | The singularity K(G) of a graph G is equal to the minimum number of linearly dependent rows of the adjacency matrix of G.[M. Brown, J. W. Kennedy and B. Servatius; Graph singularity, Graph Theory Notes of New York, XXV:4, New York Academy of Sciences, 23-32 (1993).] We determine proper- ties of graphs for which K(G) is equal to the order of G. |
| URI: | https://www.um.edu.mt/library/oar/handle/123456789/95127 |
| Appears in Collections: | Scholarly Works - FacSciMat |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| Graphs_with_maximum_singularity.pdf Restricted Access | 559.91 kB | Adobe PDF | View/Open Request a copy |
Items in OAR@UM are protected by copyright, with all rights reserved, unless otherwise indicated.