Please use this identifier to cite or link to this item:
https://www.um.edu.mt/library/oar/handle/123456789/28233| Title: | Minimal configurations and interlacing |
| Authors: | Sciriha, Irene Gutman, Ivan |
| Keywords: | Mathematics -- Charts, diagrams, etc. Mathematics -- Problems, exercises, etc. |
| Issue Date: | 2005 |
| Publisher: | Mathematical Association of America |
| Citation: | Sciriha, I., & Gutman, I. (2005). Minimal configurations and interlacing. Graph Theory Notes of New York, 49(7), 38-40. |
| Abstract: | A graph is singular of nullity n if zero is an eigenvalue of its adjacency matrix with multiplicity n. A subgraph that forces a graph to be singular is called a minimal configuration. We show various properties of minimal configurations. |
| URI: | https://www.um.edu.mt/library/oar//handle/123456789/28233 |
| Appears in Collections: | Scholarly Works - FacSciMat |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| Minimal_configurations_and_interlacing_2005.pdf | 82.24 kB | Adobe PDF | View/Open |
Items in OAR@UM are protected by copyright, with all rights reserved, unless otherwise indicated.